English
Related papers

Related papers: Substitution invariant Sturmian words and binary t…

200 papers

We study the correspondence between equivalence classes of pairs consisting of real semisimple Lie algebras and their Cartan subalgebras and involutions of the corresponding root system. This can be graphically described by introducing…

Rings and Algebras · Mathematics 2024-06-17 S. Marini , C. Medori , M. Nacinovich

We consider absolutely free nonassociative algebras and, more generally, absolutely free algebras with (maybe infinitely) many multilinear operations. Such algebras are described in terms of labeled reduced planar rooted trees. This allows…

Rings and Algebras · Mathematics 2009-03-25 Vesselin Drensky , Ralf Holtkamp

In analogy to other concepts of a similar nature, we define the inducibility of a rooted binary tree. Given a fixed rooted binary tree $B$ with $k$ leaves, we let $\gamma(B,T)$ be the proportion of all subsets of $k$ leaves in $T$ that…

Combinatorics · Mathematics 2016-01-27 Éva Czabarka , László A. Székely , Stephan Wagner

Let $R_\alpha$ be an irrational rotation of the circle, and code the orbit of any point $x$ by whether $R_\alpha^i(x)$ belongs to $[0,\alpha)$ or $[\alpha,1)$ -- this produces a Sturmian sequence. A point is undetermined at step $j$ if its…

Dynamical Systems · Mathematics 2018-07-06 Jon Chaika , David Constantine

Our main result is the proof of an inequality between the spectral numbers of a Lagrangian and the spectral numbers of its reductions, in the opposite direction to the classical inequality (see e.g [Vit92]). This has applications to the…

Symplectic Geometry · Mathematics 2022-03-25 Claude Viterbo

It is shown that the problem of computing the Strahler number of a binary tree given as a term is complete for the circuit complexity class uniform $\mathsf{NC}^1$. For several variants, where the binary tree is given by a pointer structure…

Computational Complexity · Computer Science 2025-12-23 Moses Ganardi , Markus Lohrey

We use combinatorial group theory methods to extend the definition of a classical James-Hopf invariant to a simplicial group setting. This allow us to realize certain coalgebra idempotents at sSet -level and obtain a functorial…

Algebraic Topology · Mathematics 2019-02-13 Fedor Pavutnitskiy , Jie Wu

We give an optimal version of the classical ``three-gap theorem'' on the fractional parts of $n \theta$, in the case where $\theta$ is an irrational number that is badly approximable. As a consequence, we deduce a version of Kronecker's…

Number Theory · Mathematics 2020-06-30 Dmitry Badziahin , Jeffrey Shallit

Binary search trees (BST) are a popular type of data structure when dealing with ordered data. Indeed, they enable one to access and modify data efficiently, with their height corresponding to the worst retrieval time. From a probabilistic…

Probability · Mathematics 2025-01-28 Benoît Corsini , Victor Dubach , Valentin Féray

We provide an explicit algorithm to calculate invariant tensors for the adjoint representation of the simple Lie algebra $sl(n)$, as well as arbitrary representation in terms of roots. We also obtain explicit formulae for the adjoint…

Geometric Topology · Mathematics 2007-05-23 R. Campoamor-Stursberg , V. O. Manturov

We identify a new symmetry for the equations governing odderon amplitudes, corresponding in the Regge limit of QCD to the exchange of 3 reggeized gluons. The symmetry is a modular invariance with respect to the unique normal subgroup of…

High Energy Physics - Theory · Physics 2016-09-06 Romuald Janik

We introduce a square root map on Sturmian words and study its properties. Given a Sturmian word of slope $\alpha$, there exists exactly six minimal squares in its language (a minimal square does not have a square as a proper prefix). A…

Discrete Mathematics · Computer Science 2017-04-05 Jarkko Peltomäki , Markus Whiteland

We introduce a sequent calculus with a simple restriction of Lambek's product rules that precisely captures the classical Tamari order, i.e., the partial order on fully-bracketed words (equivalently, binary trees) induced by a…

Logic in Computer Science · Computer Science 2017-01-12 Noam Zeilberger

Rooted binary perfect phylogenies provide a generalization of rooted binary unlabeled trees in which each leaf is assigned a positive integer value that corresponds in a biological setting to the count of the number of indistinguishable…

Populations and Evolution · Quantitative Biology 2024-10-22 Chloe E. Shiff , Noah A. Rosenberg

A very classical subject in Commutative Algebra is the Invariant Theory of finite groups. In our work on 3-dimensional topology (S. King, Ideal Turaev-Viro invariants. To appear in Top. Appl.), we found certain examples of group actions on…

Commutative Algebra · Mathematics 2007-05-23 Simon A. King

Infinite-dimensional Grassmannian manifold contains moduli spaces of Riemann surfaces of all genera. This well known fact leads to a conjecture that non-perturbative string theory can be formulated in terms of Grassmannian. We present new…

High Energy Physics - Theory · Physics 2010-11-19 Albert Schwarz

Consider complex semisimple Lie algebras of a given dimension specified by their structure constants. We describe a finite collection of rational functions in the structure constants that form a complete set of invariants: two sets of…

Rings and Algebras · Mathematics 2007-05-23 Vijay Kodiyalam , K. N. Raghavan

We consider three bivariate polynomial invariants $P$, $A$, and $S$ for rooted trees, as well as a trivariate polynomial invariant $M$. These invariants are motivated by random destruction processes such as the random cutting model or site…

Combinatorics · Mathematics 2024-10-08 Fabian Burghart

For an $S^1$-framed modular operad $P$, we introduce its "Feynman compactification" denoted by $FP$ which is a modular operad. Let $\{\mathbb{M}^{\sf fr}(g,n)\}_{(g,n)}$ be the $S^1$-framed modular operad defined using moduli spaces of…

Symplectic Geometry · Mathematics 2026-03-19 Junwu Tu

Eilenberg-type correspondences, relating varieties of languages (e.g. of finite words, infinite words, or trees) to pseudovarieties of finite algebras, form the backbone of algebraic language theory. Numerous such correspondences are known…

Formal Languages and Automata Theory · Computer Science 2017-02-27 Henning Urbat , Jiří Adámek , Liang-Ting Chen , Stefan Milius
‹ Prev 1 4 5 6 7 8 10 Next ›