Transverse intersections between invariant manifolds of doubly hyperbolic invariant tori, via the Poincaré-Mel’nikov method

We consider a perturbation of an integrable Hamiltonian system having an equilibrium point of elliptic-hyperbolic type, having a homoclinic orbit. More precisely, we consider an (n + 2)-degree-of-freedom near integrable Hamiltonian with n centers and 2 saddles, and assume that the homoclinic orbit is preserved under the perturbation. On the center manifold near the equilibrium, there is a Cantorian family of hyperbolic KAM tori, and we study the homoclinic intersections between the stable and unstable manifolds associated to such tori. We establish that, in general, the manifolds intersect along transverse homoclinic orbits. In a more concrete model, such homoclinic orbits can be detected, in a first approximation, from nondegenerate critical points of a Mel’nikov potential. We provide bounds for the number of transverse homoclinic orbits using that, in general, the potential will be a Morse function (which gives a lower bound) and can be approximated by a trigonometric polynomial (which gives an upper bound).     

Concentration of points on curves in finite fields

We obtain analogues of several recent bounds on the number of solutions of polynomial congruences modulo a prime with variables in short intervals in the case of polynomial equations in high degree extensions of finite fields. In these settings low-dimensional affine spaces play the role of short intervals and thus several new ideas are required.     

Adjoint and Coadjoint Orbits of the Poincaré Group

In this paper we give an effective method for finding a unique representative of each orbit of the adjoint and coadjoint action of the real affine orthogonal group on its Lie algebra. In both cases there are orbits which have a modulus that is different from the usual invariants for orthogonal groups. We find an unexplained bijection between adjoint and coadjoint orbits. As a special case, we classify the adjoint and coadjoint orbits of the Poincaré group.The author (R.C) was partially supported by European Community funding for the Research and Training Network MASIE (HPRN-CT-2000-00113).     

Totally nonnegative cells and matrix Poisson varieties

We describe explicitly the admissible families of minors for the totally nonnegative cells of real matrices, that is, the families of minors that produce nonempty cells in the cell decompositions of spaces of totally nonnegative matrices introduced by A. Postnikov. In order to do this, we relate the totally nonnegative cells to torus orbits of symplectic leaves of the Poisson varieties of complex matrices. In particular, we describe the minors that vanish on a torus orbit of symplectic leaves, we prove that such families of minors are exactly the admissible families, and we show that the nonempty totally nonnegative cells are the intersections of the torus orbits of symplectic leaves with the spaces of totally nonnegative matrices.     

有限局部环上对称矩阵的计数定理(Ⅰ)

设A_n(R)是有限局部环Z/p~k Z上n阶对称矩阵的集合,这里n≥2．p是大于2素数,p≡1(mod4)且k＞1．通过确定有限局部环Z/p~k Z上对称矩阵的标准型,计算出A_n(R)在线性群GL_n(R)作用下的轨道数,从而计算出由特定对称矩阵确定的正交群的阶以及与特定对称矩阵在同一轨道的对称矩阵的阶．     

求鳞状循环因子矩阵的极小多项式的算法

提出了任意域上鳞状循环因子矩阵 ,利用多项式环的理想的Go bner基的算法给出了任意域上鳞状循环因子矩阵的极小多项式和公共极小多项式的一种算法 .同时给出了这类矩阵逆矩阵的一种求法 .在有理数域或模素数剩余类域上 ,这一算法可由代数系统软件Co CoA4 .0实现 .数值例子说明了算法的有效性     

Algorithms for finding the minimal polynomials and inverses of resultant matrices

In this paper, algorithms for computing the minimal polynomial and the common minimal polynomial of resultant matrices over any field are presented by means of the approach for the Gröbner basis of the ideal in the polynomial ring, respectively, and two algorithms for finding the inverses of such matrices are also presented. Finally, an algorithm for the inverse of partitioned matrix with resultant blocks over any field is given, which can be realized by CoCoA 4.0, an algebraic system over the field of rational numbers or the field of residue classes of modulo prime number. We get examples showing the effectiveness of the algorithms.     

Classification of multivariate skew polynomial rings over finite fields via affine transformations of variables

In this work, free multivariate skew polynomial rings are considered, together with their quotients over ideals of skew polynomials that vanish at every point (which includes minimal multivariate skew polynomial rings). We provide a full classification of such multivariate skew polynomial rings (free or not) over finite fields. To that end, we first show that all ring morphisms from the field to the ring of square matrices are diagonalizable, and that the corresponding derivations are all inner derivations. Secondly, we show that all such multivariate skew polynomial rings over finite fields are isomorphic as algebras to a multivariate skew polynomial ring whose ring morphism from the field to the ring of square matrices is diagonal, and whose derivation is the zero derivation. Furthermore, we prove that two such representations only differ in a permutation on the field automorphisms appearing in the corresponding diagonal. The algebra isomorphisms are given by affine transformations of variables and preserve evaluations and degrees. In addition, ours proofs show that the simplified form of multivariate skew polynomial rings can be found computationally and explicitly.     

Effective cycles on blow-ups of Grassmannians

In this paper we study the pseudoeffective cones of blow-ups of Grassmannians at sets of points. For small numbers of points, the cones are often spanned by proper transforms of Schubert classes. In some special cases, we provide sharp bounds for when the Schubert classes fail to span and we describe the resulting geometry.     

The group and the minimal polynomial of a graph

This paper presents some results linking the minimal polynomial of the adjacency matrix of a graph with its group structure. An upper bound on the order of the group is derived for graphs whose minimal and characteristic polynomials are identical. It is also shown that for a graph with transitive group, the degree of the minimal polynomial is bounded above by the number of orbits of the stabilizer of any given element. Finally, the order of the group of a point-symmetric graph with a prime number of points is shown to depend on the degree of the minimal polynomial, and an algorithm for constructing such a group is given.     

Characteristic polynomials of symmetric graphs

In this paper, we study the characteristic polynomials of graphs which admit semifree actions of an abelian group. Using the method of group matrices, we are able to show that the characteristic polynomial of a such a graph is factorized into a product of a polynomial associated to the orbit of the action and a polynomial associated to the free part of the action.     

Bounds for the extremal eigenvalues of a class of symmetric tridiagonal matrices with applications

We consider a class of symmetric tridiagonal matrices which may be viewed as perturbations of Toeplitz matrices. The Toeplitz structure is destroyed since two elements on each off-diagonal are perturbed. Based on a careful analysis, we derive sharp bounds for the extremal eigenvalues of this class of matrices in terms of the original data of the given matrix. In this way, we also obtain a lower bound for the smallest singular value of certain matrices. Some numerical results indicate that our bounds are extremely good.     

有限局部环上对称矩阵的计数定理(I)

设$A_{n}(R)$是有限局部环$Z/p^{k}Z$上$n$阶对称矩阵的集合, 这里$n\geq 2$. $p$是大于$2$素数, $p\equiv1({\rm mod}4)$ 且$k>1$. 通过确定有限局部环$Z/p^{k}Z$上对称矩阵的标准型, 计算出$A_{n}(R)$在线性群${\rm GL}_{n}(R)$作用下的轨道数, 从而计算出由特定对称矩阵确定的正交群的阶以及与特定对称矩阵在同一轨道的对称矩阵的阶.     

On pseudorandom numbers from multivariate polynomial systems

We bound exponential sums along the orbits of essentially arbitrary multivariate polynomial dynamical systems, provided that the orbits are long enough. We use these bounds to derive nontrivial estimates on the discrepancy of pseudorandom vectors generated by such polynomial systems. We generalize several previous results and in particular suggest a new approach that eliminates the need to control the degree growth of the iterations of these polynomial systems, which has been an obstacle in all previous approaches.     

Looping of the numbers game and the alcoved hypercube

We study the so-called looping case of Mozes?s game of numbers, which concerns the (finite) orbits in the reflection representation of affine Weyl groups situated on the boundary of the Tits cone. We give a simple proof that all configurations in the orbit are obtainable from each other by playing the numbers game, and give a strategy for going from one configuration to another. This strategy gives rise to a partition of the finite Weyl group into finitely many graded posets, one for each extending vertex of the associated extended Dynkin diagram. These posets are self-dual and mutually isomorphic, and their Hasse diagrams are dual to the triangulation of the unit hypercube by reflecting hyperplanes. Unlike the weak and Bruhat orders, the top degree is cubic in the number of vertices of the graph. We explicitly compute the rank generating function of the poset.     

Euclidean distance degree and limit points in a Morsification

Motivated by finding an effective way to compute the algebraic complexity of the nearest point problem for algebraic models, we introduce an efficient method for detecting the limit points of the stratified Morse trajectories in a small perturbation of any polynomial function on a complex affine variety. We compute the multiplicities of these limit points in terms of vanishing cycles. In the case of functions with only isolated stratified singularities, we express the local multiplicities in terms of polar intersection numbers.     

Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers

We present a new probabilistic method for solving systems of polynomial equations and inequations. Our algorithm computes the equidimensional decomposition of the Zariski closure of the solution set of such systems. Each equidimensional component is encoded by a generic fiber, that is a finite set of points obtained from the intersection of the component with a generic transverse affine subspace. Our algorithm is incremental in the number of equations to be solved. Its complexity is mainly cubic in the maximum of the degrees of the solution sets of the intermediate systems counting multiplicities.Our method is designed for coefficient fields having characteristic zero or big enough with respect to the number of solutions. If the base field is the field of the rational numbers then the resolution is first performed modulo a random prime number after we have applied a random change of coordinates. Then we search for coordinates with small integers and lift the solutions up to the rational numbers. Our implementation is available within our package Kronecker from version 0.166, which is written in the Magma computer algebra system.     

Uniform estimates for the X-ray transform restricted to polynomial curves

We establish near-optimal mixed norm estimates for the X-ray transform restricted to polynomial curves with a weight that is a power of the affine arclength. The bounds that we establish depend only on the spatial dimension and the degree of the polynomial. Some of our results are new even in the well-curved case.     

The conditioning of Toeplitz band matrices

In this paper, practical conditions to check the well-conditioning of a family of nonsingular Toeplitz band matrices are obtained. All the results are based on the location of the zeros of a polynomial associated with the given family of Toeplitz matrices.The same analysis is also used to derive uniform componentwise bounds for the entries of the inverse matrices in such family.     

On groups of hyperbolic length

We investigate the recently introduced notion of rotation numbers for periodic orbits of interval maps. We identify twist orbits, that is those orbits that are the simplest ones with given rotation number. We estimate from below the topological entropy of a map having an orbit with given rotation number. Our estimates are sharp: there are unimodal maps where the equality holds. We also discuss what happens for maps with larger modality. In the Appendix we present a new approach to the problem of monotonicity of entropy in one-parameter families of unimodal maps. This work was partially done during the first author’s visit to IUPUI (funded by a Faculty Research Grant from UAB Graduate School) and his visit to MSRI (the research at MSRI funded in part by NSF grant DMS-9022140) whose support the first author acknowledges with gratitude. The second author was partially supported by NSF grant DMS-9305899, and his gratitude is as great as that of the first author.