Darboux points and integrability of homogeneous Hamiltonian systems with three and more degrees of freedom

We consider natural complex Hamiltonian systems with n degrees of freedom given by a Hamiltonian function which is a sum of the standard kinetic energy and a homogeneous polynomial potential V of degree k > 2. The well known Morales-Ramis theorem gives the strongest known necessary conditions for the Liouville integrability of such systems. It states that for each k there exists an explicitly known infinite set ⊂ ℚ such that if the system is integrable, then all eigenvalues of the Hessian matrix V″(d) calculated at a non-zero d ∈ ℂ ⁿ satisfying V′(d) = d, belong to . The aim of this paper is, among others, to sharpen this result. Under certain genericity assumption concerning V we prove the following fact. For each k and n there exists a finite set such that if the system is integrable, then all eigenvalues of the Hessian matrix V″(d) belong to . We give an algorithm which allows to find sets . We applied this results for the case n = k = 3 and we found all integrable potentials satisfying the genericity assumption. Among them several are new and they are integrable in a highly non-trivial way. We found three potentials for which the additional first integrals are of degree 4 and 6 with respect to the momenta.      

Asymptotics of degrees of someS n-sub regular representations

The numbers % MathType!End!2!1!, λ ⊢n appear in the enumeration of various objects, as well as coefficients inS _nrepresentations associated with products of higher commutators. We study their asymptotics asn→∞ and show that if (λ₁, λ₂, …)≈(α ₁,α ₂, …)n, if (λ′₁, λ′₂, …)≈(β ₁,β ₂, …)n and ifγ=1− Σ _k⩽1(α _k⩽1+β _k⩽1), then % MathType!End!2!1!. Work partially supported by N.S.F. Grant No. DMS 94-01197.     

On the replications of certain multiplicative designs

Bounds on the number of row sums in ann×n, non-singular (0,1)-matrixA sarisfyingA ^tA=diag (k ₁-λ₁,…,k _n-λ_n),k _j>λ_j>0,λ₁=…=λ_e,λ_e+1=…=λ_n are obtained which extend previous results for such matrices.     

Singular Manakov flows and geodesic flows on homogeneous spaces of SO(N)

We prove complete integrability of the Manakov-type SO(n)-invariant geodesic flows on homogeneous spaces SO(n)/SO(k₁) ×⋯× SO(k _r ), for any choice of k ₁,…,k _r , k ₁ + ⋯ + k _r ⩽ n. In particular, a new proof of the integrability of a Manakov symmetric rigid body motion around a fixed point is presented. Also, the proof of integrability of the SO(n)-invariant Einstein metrics on SO(k ₁ + k ₂ + k ₃)/SO(k ₁) × SO(k ₂) × SO(k ₃) and on the Stiefel manifolds V (n, k) = SO(n)/SO(k) is given.     

A Polynomial-Time Algorithm to Approximate the Mixed Volume within a Simply Exponential Factor

Let K=(K ₁,…,K _n ) be an n-tuple of convex compact subsets in the Euclidean space R ⁿ , and let V(⋅) be the Euclidean volume in R ⁿ . The Minkowski polynomial V _K is defined as V _K (λ ₁,…,λ _n )=V(λ ₁ K ₁+⋅⋅⋅+λ _n K _n ) and the mixed volume V(K ₁,…,K _n ) as

Ideal einstein,conformally flat and semi-symmetric immersions

Recently, B. Y. Chen introduced a new intrinsic invariant of a manifold, and proved that everyn-dimensional submanifold of real space formsR ^m (ε) of constant sectional curvature ε satisfies a basic inequality δ(n ₁,…,n _k )≤c(n ₁,…,n _k )H ²+b(n ₁,…,n _k )ε, whereH is the mean curvature of the immersion, andc(n ₁,…,n _k ) andb(n ₁,…,n _k ) are constants depending only onn ₁,…,n _k ,n andk. The immersion is calledideal if it satisfies the equality case of the above inequality identically for somek-tuple (n ₁,…,n _k ). In this paper, we first prove that every ideal Einstein immersion satisfyingn≥n ₁+…+n _k +1 is totally geodesic, and that every ideal conformally flat immersion satisfyingn≥n ₁+…+n _k +2 andk≥2 is also totally geodesic. Secondly we completely classify all ideal semi-symmetric hypersurfaces in real space forms. The author was supported by the NSFC and RFDP.     

The Erdös-Jacobson-Lehel conjecture on potentiallyP k-graphic sequence is true

A variation in the classical Turan extrernal problem is studied. A simple graphG of ordern is said to have propertyPk if it contains a clique of sizek+1 as its subgraph. Ann-term nonincreasing nonnegative integer sequence π=(d₁, d₂,⋯, d₂) is said to be graphic if it is the degree sequence of a simple graphG of ordern and such a graphG is referred to as a realization of π. A graphic sequence π is said to be potentiallyP _k-graphic if it has a realizationG having propertyP _k . The problem: determine the smallest positive even number σ(k, n) such that everyn-term graphic sequence π=(d₁, d₂,…, d₂) without zero terms and with degree sum σ(π)=(d ₁+d ₂+ …+d ₂) at least σ(k,n) is potentially P_k-graphic has been proved positive. Project supported by the National Natural Science Foundation of China (Grant No. 19671077) and the Doctoral Program Foundation of National Education Department of China.     

Refined enumerations of alternating sign matrices: monotone (<Emphasis Type="Italic">d</Emphasis>,<Emphasis Type="Italic">m</Emphasis>)-trapezoids with prescribed top and bottom row

Monotone triangles are plane integer arrays of triangular shape with certain monotonicity conditions along rows and diagonals. Their significance is mainly due to the fact that they correspond to n×n alternating sign matrices when prescribing (1,2,…,n) as bottom row of the array. We define monotone (d,m)-trapezoids as monotone triangles with m rows where the d−1 top rows are removed. (These objects are also equivalent to certain partial alternating sign matrices.) It is known that the number of monotone triangles with bottom row (k ₁,…,k _n ) is given by a polynomial α(n;k ₁,…,k _n ) in the k _i ’s. The main purpose of this paper is to show that the number of monotone (d,m)-trapezoids with prescribed top and bottom row appears as a coefficient in the expansion of a specialisation of α(n;k ₁,…,k _n ) with respect to a certain polynomial basis. This settles a generalisation of a recent conjecture of Romik et al. (Adv. Math. 222:2004–2035, 2009). Among other things, the result is used to express the number of monotone triangles with bottom row (1,2,…,i−1,i+1,…,j−1,j+1,…,n) (which is, by the standard bijection, also the number of n×n alternating sign matrices with given top two rows) in terms of the number of n×n alternating sign matrices with prescribed top and bottom row, and, by a formula of Stroganov for the latter numbers, to provide an explicit formula for the first numbers. (A formula of this type was first derived by Karklinsky and Romik using the relation of alternating sign matrices to the six-vertex model.)     

Bases of admissible inference rules for table modal logics of depth 2

In the present article, we prove the theorem which states that every table modal logic λ of depth 2 over S4 has a finite basis of admissible inference rules. In addition, it is established that a finite algebra ℒ belongs to F_ω(λ)^Q iff there exist numbers n₁…, n_k such that (Lemma 5). Let F be a λ-frame of depth 2 and b a cluster of the second layer in F. We show that for any n₁,…,n_k, there exist no p-morphisms from (F_n1⊔…⊔F_nk)⁺ a local component K (b) such that, for any n, there is no p-morphism from any local component of F_n onto K (b) (Lemma 6). Translated fromAlgebra i Logika, Vol. 35, pp. 612–622, September–October, 1996.     

The Decomposition Dimension of Graphs

 For an ordered k-decomposition ? = {G ₁, G ₂,…,G _k } of a connected graph G and an edge e of G, the ?-representation of e is the k-tuple r(e|?) = (d(e, G ₁), d(e, G ₂),…,d(e, G _k )), where d(e, G _i ) is the distance from e to G _i . A decomposition ? is resolving if every two distinct edges of G have distinct representations. The minimum k for which G has a resolving k-decomposition is its decomposition dimension dec(G). It is shown that for every two positive integers k and n≥ 2, there exists a tree T of order n with dec(T) = k. It is also shown that dec(G) ≤n for every graph G of order n≥ 3 and that dec(K _n ) ≤⌊(2n + 5)/3⌋ for n≥ 3. Received: June 17, 1998 Final version received: August 10, 1999     

Degree series of the 3-harmonic graphs

A λ harmonic graph G, a λ-Hgraph G for short, means that there exists a constant λ such that the equality λd（vi） = Σ（vi,vj）∈E（G） d（vj） holds for all i = 1, 2,..., ｜V（G）｜, where d（vi） denotes the degree of vertex vi. Let ni denote the number of vertices with degree i. This paper deals with the 3-Hgraphs and determines their degree series. Moreover, the 3-Hgraphs with bounded ni （1 ≤ i ≤ 7） are studied and some interesting results are obtained.     

On Enomoto’s problems in a bipartite graph

In this paper, we obtain the following result: Let k, n ₁ and n ₂ be three positive integers, and let G = (V ₁,V ₂;E) be a bipartite graph with |V1| = n ₁ and |V ₂| = n ₂ such that n ₁ ⩾ 2k + 1, n ₂ ⩾ 2k + 1 and |n ₁ − n ₂| ⩽ 1. If d(x) + d(y) ⩾ 2k + 2 for every x ∈ V ₁ and y ∈ V ₂ with xy $ \notin $ \notin E(G), then G contains k independent cycles. This result is a response to Enomoto’s problems on independent cycles in a bipartite graph.     

Super Connectivity of Line Graphs and Digraphs

The h-super connectivity κh and the h-super edge-connectivity λh are more refined network reliability indices than the conneetivity and the edge-connectivity. This paper shows that for a connected balanced digraph D and its line digraph L, if D is optimally super edge-connected, then κ1（L） = 2λ1 （D）, and that for a connected graph G and its line graph L, if one of κ1 （L） and λ（G） exists, then κ1（L） = λ2（G）. This paper determines that κ1（B（d, n） is equal to 4d- 8 for n = 2 and d ≥ 4, and to 4d-4 for n ≥ 3 and d ≥ 3, and that κ1（K（d, n）） is equal to 4d- 4 for d 〉 2 and n ≥ 2 except K（2, 2）. It then follows that B（d,n） and K（d, n） are both super connected for any d ≥ 2 and n ≥ 1.     

Completely monotone multisequences, symmetric probabilities and a normal limit theorem

Let G _n,k be the set of all partial completely monotone multisequences of ordern and degreek, i.e., multisequencesc _n(β₁,β₂,…, β _k ), β₁,β₂,…, β_k = 0,1,2,…, β₁+β₂ + … +β _k ≤n,c _n(0,0,…, 0) = 1 and whenever β₀ ≤n - (β₁ + β₂ + … + β _k ) where Δc _n(β₁,β₂,…, β _k ) =c _n(β₁ + 1, β₂,…, β _k )+c _n(β₁,β₂+1,…, β _k )+…+c _n (β₁,β₂,…, β _k +1) -c _n(β₁,β₂,…, β _k ). Further, let Π _n,k be the set of all symmetric probabilities on {0,1,2,…,k} ⁿ . We establish a one-to-one correspondence between the sets G _n,k and Π _n,k and use it to formulate and answer interesting questions about both. Assigning to G _n,k the uniform probability measure, we show that, asn→∞, any fixed section {it{c_n}(β₁,β₂,…, β _k ), 1 ≤ Σβ _i ≤m}, properly centered and normalized, is asymptotically multivariate normal. That is, converges weakly to MVN[0, Σ _m ]; the centering constantsc ₀(β₁, β₂,…, β _k ) and the asymptotic covariances depend on the moments of the Dirichlet (1, 1,…, 1; 1) distribution on the standard simplex inR ^k.     

Distributions of Points in <Emphasis Type="Italic">d</Emphasis> Dimensions and Large <Emphasis Type="Italic">k</Emphasis>-Point Simplices

We consider a variant of Heilbronn’s triangle problem by investigating for a fixed dimension d≥2 and for integers k≥2 with k≤d distributions of n points in the d-dimensional unit cube [0,1] ^d , such that the minimum volume of the simplices, which are determined by (k+1) of these n points is as large as possible. Denoting by Δ _k,d (n), the supremum of this minimum volume over all distributions of n points in [0,1] ^d , we show that c _k,d ⋅(log n)^1/(d−k+1)/n ^k/(d−k+1)≤Δ _k,d (n)≤c _k,d ′/n ^k/d for fixed 2≤k≤d, and, moreover, for odd integers k≥1, we show the upper bound Δ _k,d (n)≤c _k,d ″/n ^{k/d+(k−1)/(2d(d−1))}, where c _k,d ,c _k,d ′,c _k,d ″>0 are constants. A preliminary version of this paper appeared in COCOON ’05.     

On Super Restricted Edge Connectivity of Half Vertex Transitive Graphs

Let X =  (V, E) be a connected graph. Call X super restricted edge connected in short, sup-λ′, if F is a minimum edge set of X such that X − F is disconnected and every component of X − F has at least two vertices, then F is the set of edges adjacent to a certain edge with minimum edge degree in X. A bipartite graph is said to be half vertex transitive if its automorphism group is transitive on the sets of its bipartition. In this article, we show that every connected half vertex transitive graph X with n =  |V(X)| ≥  4 and X \ncong K_1,n-1{X \ncong K_{1,n-1}} is λ′-optimal. By studying the λ′-superatoms of X, we characterize sup-λ′ connected half vertex transitive graphs. As a corollary, sup-λ′ connected Bi-Cayley graphs are also characterized.     

Asymptotics of multinomial sums and identities between multi-integrals

We calculate the asymptotics of combinatorial sums ∑ _α f(α)( _α ⁿ ) ^β , whereα = (α ₁, …,α _h ) withα _i =α _j for certaini, j. Hereh is fixed and theα _i ’s are natural numbers. This implies the asymptotics of the correspondingS _n -character degrees ∑_λ f(λ)d _λ ^β . For certain sequences ofS _n characters which involve Young’s rule, the latter asymptotics were obtained earlier [1] by a different method. Equating the two asymptotics, we obtain equations between multi-integrals which involve Gaussian measures. Special cases here give certain extensions of the Mehta integral [5], [6]. Supported by the Weizmann Institute of Science, Rehovot, Israel; by the Institute for Advanced Study, Princeton, New Jersey, USA; NSF grant number DMS 9304580; and by the Centre National de Recherche Scientifique, Lille, France. This work was partially supported by an NSF grant number DMS 94-01197.     

Deformation of certain quadratic algebras and the corresponding quantum semigroups

LetV be a finite-dimensional vector space. Given a decompositionV⊗V=⊕ _i=1,…n I _i , definen quadratic algebrasQ(V, J _(m)) whereJ _(m)=⊕ _i≠m I _i . There is also a quantum semigroupM(V; I ₁, …,I _n ) which acts on all these quadratic algebras. The decomposition determines as well a family of associative subalgebras of End (V ^⊗k ), which we denote byA _k =A _k (I ₁,…,I _n ),k≥2. In the classical case, whenV⊗V decomposes into the symmetric and skewsymmetric tensors,A _k coincides with the image of the representation of the group algebra of the symmetric groupS _k in End(V ^⊗k ). LetI _i,h be deformations of the subspacesI _i . In this paper we give a criteria for flatness of the corresponding deformations of the quadratic algebrasQ(V, J _(m),h ) and the quantum semigroupM(V;I _1,h ,…,I _n,h ). It says that the deformations will be flat if the algebrasA _k (I ₁, …,I _n ) are semisimple and under the deformation their dimension does not change. Usually, the decomposition intoI _i is defined by a given semisimple operatorS onV⊗V, for whichI _i are its eigensubspaces, and the deformationsI _i,h are defined by a deformationS _h ofS. We consider the cases whenS _h is a deformation of Hecke or Birman-Wenzl symmetry, and also the case whenS _h is the Yang-Baxter operator which appears by a representation of the Drinfeld-Jimbo quantum group. Applying the flatness criteria we prove that in all these cases we obtain flat deformations of the quadratic algebras and the corresponding quantum semigroups. Partially supported by a grant from the Israel Science Foundation administered by the Israel Academy of Sciences.