Related papers: A structure theorem for polynomial return-time set…
We show that several families of polynomials defined via fillings of diagrams satisfy linear recurrences under a natural operation on the shape of the diagram. We focus on key polynomials, (also known as Demazure characters), and Demazure…
Using the language of finite element exterior calculus, we define two families of $H^1$-conforming finite element spaces over pyramids with a parallelogram base. The first family has matching polynomial traces with tensor product elements…
Linear recurrent sequences are those whose elements are defined as linear combinations of preceding elements, and finding recurrence relations is a fundamental problem in computer algebra. In this paper, we focus on sequences whose elements…
Through careful analysis of types inspired by [AGTW21] we characterize a notion of definable compactness for definable topologies in general o-minimal structures, generalizing results from [PP07] about closed and bounded definable sets in…
We prove, for an arbitrary finite root system, the periodicity conjecture of Al.B.Zamolodchikov concerning Y-systems, a particular class of functional relations arising in the theory of thermodynamic Bethe ansatz. Algebraically, Y-systems…
A category structure for ordered Bratteli diagrams is proposed in which isomorphism coincides with the notion of equivalence of Herman, Putnam, and Skau. It is shown that the natural one-to-one correspondence between the category of Cantor…
The Chinese Remainder Theorem for the integers says that every system of congruence equations is solvable as long as the system satisfies an obvious necessary condition. This statement can be generalized in a natural way to arbitrary…
The reconstruction theorem and the multilevel Schauder estimate have central roles in the analytic theory of regularity structures [17]. Inspired by [26], we provide elementary proofs for them by using the semigroup of operators.…
We consider the set $\mathcal{R}_\mathrm{io}$ of points returning infinitely many times to a sequence of shrinking targets around themselves. Under additional assumptions we improve Boshernitzan's pioneering result on the speed of…
We investigate a stronger formulation of Webb's conjecture on the contractibilty of the orbit space of the p-subgroup complexes in terms of finite topological spaces. The original conjecture, which was first proved by Symonds and, more…
We present a unified theory for formal mathematical systems including recursive systems closely related to formal grammars, including the predicate calculus as well as a formal induction principle. We introduce recursive systems generating…
In order to simulate observational and experimental situations, we consider a leak in the phase space of a chaotic dynamical system. We obtain an expression for the escape rate of the survival probability applying the theory of transient…
We consider the model of a point-vortex under a periodic perturbation and give sufficient conditions for the existence of generalized quasi-periodic solutions with rotation number. The proof uses Aubry-Mather theory to obtain the existence…
For a probability measure preserving dynamical system $(\mathcal{X},f,\mu)$, the Poincar\'e Recurrence Theorem asserts that $\mu$-almost every orbit is recurrent with respect to its initial condition. This motivates study of the statistics…
In this paper we study a one-parameter family of attractive reversible nearest particle system on a finite interval. As the length of the interval increases, the time that the nearest particle system first hits the empty set increases in…
We identify a recursive structure among factorizations of polynomial values into two integer factors. Polynomials for which this recursive structure characterizes all non-trivial representations of integer factorizations of the polynomial…
A classic family in topological dynamics is that of minimal rotations. One natural extension of this family is the class of nilsystems and their inverse limits. These systems have arisen in recent applications in ergodic theory and in…
A graph is reconstructible if it is determined up to isomorphism by the multiset of its proper induced subgraphs. The reconstruction conjecture postulates that every graph of order at least 3 is reconstructible. We show that interval graphs…
We present an illustrative application of the two famous mathematical theorems in differential topology in order to show the existence of periodic orbits with arbitrary given period for a class of hamiltonians .This result point out for a…
We use the structure theory of minimal dynamical systems to show that, for a general group $\Gamma$, a tame, metric, minimal dynamical system $(X, \Gamma)$ has the following structure: \begin{equation*} \xymatrix {& \tilde{X} \ar[dd]_\pi…