A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free

A graph G is diameter 2-critical if its diameter is 2, and the deletion of any edge increases the diameter. Murty and Simon conjectured that the number of edges in a diameter 2-critical graph of order n is at most n²/4 and that the extremal graphs are complete bipartite graphs with equal size partite sets. We use an important association with total domination to prove the conjecture for the graphs whose complements are claw-free.     

Classification of the centers and their isochronicity for a class of polynomial differential systems of arbitrary degree

In this paper we classify the centers localized at the origin of coordinates, and their isochronicity for the polynomial differential systems in R² of degree d that in complex notation z=x+iy can be written as where j is either 0 or 1. If j=0 then d?5 is an odd integer and n is an even integer satisfying 2?n?(d+1)/2. If j=1 then d?3 is an integer and n is an integer with converse parity with d and satisfying 0<n?[(d+1)/3] where [⋅] denotes the integer part function. Furthermore λ∈R and A,B,C,D∈C. Note that if d=3 and j=0, we are obtaining the generalization of the polynomial differential systems with cubic homogeneous nonlinearities studied in K.E. Malkin (1964) [17], N.I. Vulpe and K.S. Sibirskii (1988) [25], J. Llibre and C. Valls (2009) [15], and if d=2, j=1 and C=0, we are also obtaining as a particular case the quadratic polynomial differential systems studied in N.N. Bautin (1952) [2], H. Zoladek (1994) [26]. So the class of polynomial differential systems here studied is very general having arbitrary degree and containing the two more relevant subclasses in the history of the center problem for polynomial differential equations.     

Coupled fixed points of multivalued operators and first-order ODEs with state-dependent deviating arguments

We establish a coupled fixed point theorem for a meaningful class of mixed monotone multivalued operators, and then we use it to derive some results on the existence of quasisolutions and unique solutions to first-order functional differential equations with state-dependent deviating arguments. Our results are very general and can be applied to functional equations featuring discontinuities with respect to all of their arguments, but we emphasize that they are new even for differential equations with continuously state-dependent delays.     

The higher-order Picone identity and comparison of half-linear differential equations of even order

An identity of the Picone type for higher-order half-linear ordinary differential operators of the form and where p_j and P_j, j=0,…,n, are continuous functions defined on [a,b] and , is derived and then the Sturmian comparison theory for the corresponding 2nth-order equations l_α[x]=0 and L_α[y]=0 based on this identity is developed.     

Permutation polynomials over finite fields from a powerful lemma

Using a lemma proved by Akbary, Ghioca, and Wang, we derive several theorems on permutation polynomials over finite fields. These theorems give not only a unified treatment of some earlier constructions of permutation polynomials, but also new specific permutation polynomials over Fq. A number of earlier theorems and constructions of permutation polynomials are generalized. The results presented in this paper demonstrate the power of this lemma when it is employed together with other techniques.     

On special types of nonholonomic contact elements

Our starting point has been a recent clarification of the role of semiholonomic contact elements in the theory of submanifolds of Cartan geometries, Kolá? and Vitolo (2010) [5]. We deduce some further properties of the iterated contact elements by using the general concept of contact (n,F)-element for a regular subcategory F of the category of nonholonomic r-jets. Special attention is paid to the incidence relation of contact F-elements of different dimensions.     

Orthogonal exponentials on the generalized plane Sierpinski gasket

The self-affine measure μ_Mp,D corresponding tois supported on the the generalized plane Sierpinski gasket T(M_p,D). In the present paper we show that there exist at most 3 mutually orthogonal exponential functions in L²(μ_Mp,D), and the number 3 is the best. This generalizes several known results on the non-spectral self-affine measure problem.     

A Greedy Partition Lemma for directed domination

A directed dominating set in a directed graph D is a set S of vertices of V such that every vertex u∈V(D)?S has an adjacent vertex v in S with v directed to u. The directed domination number of D, denoted by γ(D), is the minimum cardinality of a directed dominating set in D. The directed domination number of a graph G, denoted Γ_d(G), is the maximum directed domination number γ(D) over all orientations D of G. The directed domination number of a complete graph was first studied by Erd?s [P. Erd?s On a problem in graph theory, Math. Gaz. 47 (1963) 220–222], albeit in a disguised form. In this paper we prove a Greedy Partition Lemma for directed domination in oriented graphs. Applying this lemma, we obtain bounds on the directed domination number. In particular, if α denotes the independence number of a graph G, we show that α≤Γ_d(G)≤α(1+2ln(n/α)).     

Isochronicity conditions for some planar polynomial systems II

We study the isochronicity of centers at O∈R² for systems where A,B∈R[x,y], which can be reduced to the Liénard type equation. When deg(A)?4 and deg(B)?4, using the so-called C-algorithm we found 36 new multiparameter families of isochronous centers. For a large class of isochronous centers we provide an explicit general formula for linearization. This paper is a direct continuation of a previous one with the same title [Islam Boussaada, A. Raouf Chouikha, Jean-Marie Strelcyn, Isochronicity conditions for some planar polynomial systems, Bull. Sci. Math. 135 (1) (2011) 89–112], but it can be read independently.     

Isochronicity conditions for some planar polynomial systems

We study the isochronicity of centers at O∈R² for systems , , where A,B∈R[x,y], which can be reduced to the Liénard type equation. Using the so-called C-algorithm we have found 27 new multiparameter isochronous centers.     

Limit cycles, invariant meridians and parallels for polynomial vector fields on the torus

We study the polynomial vector fields of arbitrary degree in R³ having the 2-dimensional torus invariant by their flow. We characterize all the possible configurations of invariant meridians and parallels that these vector fields can exhibit. Furthermore we analyze when these invariant either meridians or parallels can be limit cycles.     

Halanay type inequalities on time scales with applications

This paper aims to introduce Halanay type inequalities on time scales. By means of these inequalities we derive new global stability conditions for nonlinear dynamic equations on time scales. Giving several examples we show that besides generalization and extension to q-difference case, our results also provide improvements for the existing theory regarding differential and difference inequalities, which are the most important particular cases of dynamic inequalities on time scales.     

On duality and fractionality of multicommodity flows in directed networks

In this paper we address a topological approach to multiflow (multicommodity flow) problems in directed networks. Given a terminal weight μ, we define a metrized polyhedral complex, called the directed tight span T_μ, and prove that the dual of the μ-weighted maximum multiflow problem reduces to a facility location problem on T_μ. Also, in case where the network is Eulerian, it further reduces to a facility location problem on the tropical polytope spanned by μ. By utilizing this duality, we establish the classifications of terminal weights admitting a combinatorial min–max relation (i) for every network and (ii) for every Eulerian network. Our result includes the Lomonosov–Frank theorem for directed free multiflows and Ibaraki–Karzanov–Nagamochi’s directed multiflow locking theorem as special cases.     

A semi-recursion for the number of involutions in special orthogonal groups over finite fields

Let I(n) be the number of involutions in a special orthogonal group SO(n,Fq) defined over a finite field with q elements, where q is the power of an odd prime. Then the numbers I(n) form a semi-recursion, in that for m>1 we haveI(2m+3)=(q2m+2+1)I(2m+1)+q2m(q2m−1)I(2m−2). We give a purely combinatorial proof of this result, and we apply it to give a universal bound for the character degree sum for finite classical groups defined over Fq.     

On linear and nonlinear fourth-order eigenvalue problems with indefinite weight

We determine the principal eigenvalues of the linear indefinite weight problem Moreover, we investigate the existence of positive solutions for the corresponding nonlinear indefinite weight problem, where g:[0,1]→R is a continuous function which attains both positive and negative values, f∈C(R,R), and r is a parameter.     

The pentagram map and Y-patterns

The pentagram map, introduced by R. Schwartz, is defined by the following construction: given a polygon as input, draw all of its “shortest” diagonals, and output the smaller polygon which they cut out. We employ the machinery of cluster algebras to obtain explicit formulas for the iterates of the pentagram map.     

From rates of mixing to recurrence times via large deviations

A classic approach in dynamical systems is to use particular geometric structures to deduce statistical properties, for example the existence of invariant measures with stochastic-like behaviour such as large deviations or decay of correlations. Such geometric structures are generally highly non-trivial and thus a natural question is the extent to which this approach can be applied. In this paper we show that in many cases stochastic-like behaviour itself implies that the system has certain non-trivial geometric properties, which are therefore necessary as well as sufficient conditions for the occurrence of the statistical properties under consideration. As a by product of our techniques we also obtain some new results on large deviations for certain classes of systems which include Viana maps and multidimensional piecewise expanding maps.     

The classification of self-dual modular codes

A classification method of self-dual codes over Zm is given. If m=rs with relatively prime integers r and s, then the classification can be accomplished by double coset decompositions of Sn by automorphism groups of self-dual codes over Zr and Zs. We classify self-dual codes of length 4 over Zp for all primes p in terms of their automorphism groups and then apply our method to classify self-dual codes over Zm for arbitrary integer m. Self-dual codes of length 8 are also classified over Zpq for p,q=2,3,5,7.     

The prescribed curvature problem in dimension four

Necessary and sufficient conditions for a g-valued differential 2-form on a 4-dimensional manifold to be, locally, a curvature form, are given. The dimension four is exceptional for the problem of prescribed curvature as, in this dimension, Bianchi's identities can be eliminated for a large class of Lie algebras, including semisimple algebras. Hence, the curvature forms are characterized as the solutions to a second-order partial differential system, which is proved to be formally integrable.     

Global well posedness for the Maxwell–Navier–Stokes system in 2D

We prove global existence of regular solutions to the full MHD system (or more precisely the Maxwell–Navier–Stokes system) in 2D. We also provide an exponential growth estimate for the Hs norm of the solution when the time goes to infinity.