Related papers: The Pentagram Integrals on Inscribed Polygons
The two main approaches to the study of irreducible representations of orders (via traces and Poisson orders) have so far been applied in a completely independent fashion. We define and study a natural compatibility relation between the two…
In this note we show that pattern matching in permutations is polynomial time reducible to pattern matching in set partitions. In particular, pattern matching in set partitions is NP-Complete.
A regular $n$-gon inscribing a knot is a sequence of $n$ points on a knot, such that the distances between adjacent points are all the same. It is shown that any smooth knot is inscribed by a regular $n$-gon for any $n$.
A polynomial algorithm for graphs' isomorphism testing is constructed in assumption that there exists a corresponding polynomial algorithm for graphs with trivial automorphism group.
A plane algebraic curve whose Newton polygone contains d lattice points can be given by d points it passes through. Then the coefficients of its equation Poisson commute having been regarded as functions of coordinates of those points. It…
For a graph embedded into a surface, we relate many combinatorial parameters of the cycle matroid of the graph and the bond matroid of the dual graph with the topological parameters of the embedding. This will give an expression of the…
Recently Takens' Reconstruction Theorem was studied in the complex analytic setting by Forn{\ae}ss and Peters \cite{FP}. They studied the real orbits of complex polynomials, and proved that for non-exceptional polynomials ergodic properties…
We introduce and study integral planes associated with crystallographic and non-crystallographic integral systems in real composition algebras. For an integral order $\Order$ in such an algebra we define the plane $\Order^{2}$ with…
Given a surface with boundary and some points on its boundary, a polygon diagram is a way to connect those points as vertices of non-overlapping polygons on the surface. Such polygon diagrams represent non-crossing permutations on a surface…
The regular embeddings of complete bipartite graphs $K_{n,n}$ in orientable surfaces are classified and enumerated, and their automorphism groups and combinatorial properties are determined. The method depends on earlier classifications in…
We study different algebraic and geometric properties of Heisenberg invariant Poisson polynomial quadratic algebras. We show that these algebras are unimodular. The elliptic Sklyanin-Odesskii-Feigin Poisson algebras $q_{n,k}(\mathcal E)$…
The pentagram map was introduced by R. Schwartz more than 20 years ago. In 2009, V. Ovsienko, R. Schwartz and S. Tabachnikov established Liouville complete integrability of this discrete dynamical system. In 2011, M. Glick interpreted the…
We study the inverse problem in the theory of (standard) orthogonal polynomials involving two polynomials families $(P_n)_n$ and $(Q_n)_n$ which are connected by a linear algebraic structure such as $$P_n(x)+\sum_{i=1}^N…
In this paper we prove that the shift map defined on the moduli space of twisted pentagram spirals of type $(N, 1)$ possesses a non-standard Lax representation with an associated monodromy whose conjugation class is preserved by the map. We…
An integral polytope is a polytope whose vertices have integer coordinates. A unimodular triangulation of an integral polytope in $\mathbb{R}^d$ is a triangulation in which all simplices are integral with volume $1/d!$. A classic result of…
We show that the space of orthogonally separable coordinates on the sphere $S^3$ induces a natural family of integrable systems, which after symplectic reduction leads to a family of integrable systems on $S^2 \times S^2$. The generic…
A graph is called integral if its eigenvalues are integers. In this article, we provide the necessary and sufficient conditions for a Cayley graph over a finite symmetric algebra $R$ to be integral. This generalizes the work of So who…
The extension complexity of a polytope $P$ is the smallest integer $k$ such that $P$ is the projection of a polytope $Q$ with $k$ facets. We study the extension complexity of $n$-gons in the plane. First, we give a new proof that the…
Graph polynomials are deemed useful if they give rise to algebraic characterizations of various graph properties, and their evaluations encode many other graph invariants. Algebraic: The complete graphs $K_n$ and the complete bipartite…
In this paper, we discuss the geometric integration of hamiltonian systems on Poisson manifolds, in particular, in the case, when the Poisson structure is induced by a Lie algebra, that is, it is a Lie-Poisson structure. A Hamiltonian…