Related papers: Padded polynomials, their cousins, and geometric c…
We introduce a new family of symmetric polynomials $\mathfrak{G}^{(\mathbf{u},\mathbf{v})}_{\lambda}$ arising from exactly solvable lattice models associated with the quantised loop algebra $\mathcal{U}_{q}(\mathfrak{sl}_{2}[z^\pm])$. The…
The survey is devoted to algebraic structures related to integrable ODEs and evolution PDEs. A description of Lax representations is given in terms of vector space decomposition of loop algebras into a direct sum of Taylor series and a…
We consider systems of ordinary differential equations with quadratic homogeneous right hand side. We give a new simple proof of a result already obtained in [8,10] which gives the necessary conditions for the existence of polynomial first…
Self-maps everywhere defined on the projective space $\P^N$ over a number field or a function field are the basic objects of study in the arithmetic of dynamical systems. One reason is a theorem of Fakkruddin \cite{Fakhruddin} (with…
Within the context of Supersymmetric Quantum Mechanics and its related hierarchies of integrable quantum Hamiltonians and potentials, a general programme is outlined and applied to its first two simplest illustrations. Going beyond the…
We describe invariant principal and Cartan connections on homogeneous principal bundles and show how to calculate the curvature and the holonomy; in the case of an invariant Cartan connection we give a formula for the infinitesimal…
We prove a filtered version of the Homotopy Transfer Theorem which gives an A-infinity algebra structure on any page of the spectral sequence associated to a filtered dg-algebra. We then develop various applications to the study of the…
Following the author's previous works, we continue to consider the problem of counting the number of affine conjugacy classes of polynomials of one complex variable when its unordered collection of holomorphic fixed point indices is given.…
The symmetric Macdonald polynomials are able to be constructed out of the non-symmetric Macdonald polynomials. This allows us to develop the theory of the symmetric Macdonald polynomials by first developing the theory of their non-symmetric…
We establish the homological foundations for studying polynomially bounded group cohomology, and show that the natural map from PH^*(G;Q) to H^*(G;Q) is an isomorphism for a certain class of groups.
In the present paper we show a dichotomy theorem for the complexity of polynomial evaluation. We associate to each graph H a polynomial that encodes all graphs of a fixed size homomorphic to H. We show that this family is computable by…
We introduce the symmetricity notions of symmetric h-monoidality, symmetroidality, and symmetric flatness. As shown in our paper arXiv:1410.5675, these properties lie at the heart of the homotopy theory of colored symmetric operads and…
Understanding the difference between group orbits and their closures is a key difficulty in geometric complexity theory (GCT): While the GCT program is set up to separate certain orbit closures, many beautiful mathematical properties are…
In a previous paper, we provided some update in the treatment of the finiteness theorem for rational maps of finite degree from a fixed variety to varieties of general type. In the present paper we present another improvement, introducing…
The problem "A general characterization of uniqueness polynomial for non-critically injective polynomials" has been remained open since the last two decades. In this paper, we explore this open problem. To this end, we initiate a new…
We consider the simplest gauge theories given by one- and two- matrix integrals and concentrate on their stringy and geometric properties. We remind general integrable structure behind the matrix integrals and turn to the geometric…
We introduce the notion of Kravchuk derivations of the polynomial algebra. We prove that any element of the kernel of the derivation gives a polynomial identity satisfied by the Kravchuk polynomials. Also, we prove that any kernel element…
In this paper we study cobordism categories consisting of manifolds which are endowed with geometric structure. Examples of such geometric structures include symplectic structures, flat connections on principal bundles, and complex…
We introduce a general class of symmetric polynomials that have saturated Newton polytope and their Newton polytope has integer decomposition property. The class covers numerous previously studied symmetric polynomials.
We complete the complexity classification by degree of minimizing a polynomial over the integer points in a polyhedron in $\mathbb{R}^2$. Previous work shows that optimizing a quadratic polynomial over the integer points in a polyhedral…