English
Related papers

Related papers: Substitution invariant Sturmian words and binary t…

200 papers

The binary indexed tree, or Fenwick tree, is a data structure that can efficiently update values and calculate prefix sums in an array. It allows both of these operations to be performed in $O(\log_2 N)$ time. Here we present a novel data…

Data Structures and Algorithms · Computer Science 2024-03-08 Brent Harrison , Jason Necaise , Andrew Projansky , James D. Whitfield

Let $\mathbb{F}$ be an infinite field with characteristic different from two. For a graph $G=(V,E)$ with $V={1,...,n}$, let $S(G;\mathbb{F})$ be the set of all symmetric $n\times n$ matrices $A=[a_{i,j}]$ over $\mathbb{F}$ with…

Combinatorics · Mathematics 2012-10-29 Hein van der Holst

We investigate the structural relationship between prefix-free codes over the binary alphabet and a class of unlabeled rooted trees, which we call \emph{symmetric} trees. We establish a canonical correspondence between prefix-free codes and…

Information Theory · Computer Science 2026-03-31 Dean Kraizberg

Asymptotic analysis on some statistical properties of the random binary-tree model is developed. We quantify a hierarchical structure of branching patterns based on the Horton-Strahler analysis. We introduce a transformation of a binary…

Mathematical Physics · Physics 2013-06-03 Ken Yamamoto , Yoshihiro Yamazaki

In "Hopf algebra of the planar binary trees", Adv. Math. 139 (1998), no. 2, 293--309, we constructed by induction a graded associative product on the vector space generated by the planar binary trees (resp. the permutations). In the present…

Combinatorics · Mathematics 2016-09-07 Jean-Louis Loday , Maria O. Ronco

The classical exchange algebra satisfied by the monodromy matrix of AdS5 x S5 string theory in the Green-Schwarz formulation is determined by using a first-order Hamiltonian formulation and by adding to the Bena-Polchinski-Roiban Lax…

High Energy Physics - Theory · Physics 2009-01-16 Marc Magro

We first review some invariant theoretic results about the finite subgroups of SU(2) in a quick algebraic way by using the McKay correspondence and quantum affine Cartan matrices. By the way it turns out that some parameters (a,b,h;p,q,r)…

Representation Theory · Mathematics 2007-05-23 Ruedi Suter

Given two messages - as linear sequences of letters, it is immediate to determine whether one can be transformed into the other by simple substitution cipher of the letters. On the other hand, if the letters are carried as labels on nodes…

Discrete Mathematics · Computer Science 2022-04-14 Florian Ingels , Romain Azaïs

It is proved that classical BRS-invariance of the Lagrangian implies perturbative gauge invariance for tree diagrams to all orders. The proof applies in particular to the Einstein Hilbert Largrangian of gravity.

High Energy Physics - Theory · Physics 2009-11-11 Michael Duetsch

Let $R$ be a commutative ring with identity and a fixed invertible element $q^{\frac{1}{2}}$, and suppose $q+q^{-1}$ is invertible in $R$. For each planar surface $\Sigma_{0,n+1}$, we present its Kauffman bracket skein algebra over $R$ by…

Geometric Topology · Mathematics 2024-01-03 Haimiao Chen

Cartesian tree matching is the problem of finding all substrings of a given text which have the same Cartesian trees as that of a given pattern. So far there is one linear-time solution for Cartesian tree matching, which is based on the KMP…

Data Structures and Algorithms · Computer Science 2019-08-15 Siwoo Song , Cheol Ryu , Simone Faro , Thierry Lecroq , Kunsoo Park

Cambrian trees are oriented and labeled trees which fulfill local conditions around each node generalizing the conditions for classical binary search trees. Based on the bijective correspondence between signed permutations and leveled…

Combinatorics · Mathematics 2023-11-14 Grégory Chatel , Vincent Pilaud

We prove that a hereditary graph class $\mathcal{G}$ defined by finitely many excluded induced subgraphs has bounded tree-$\alpha$ if and only if it is "$(\mathrm{tw},\omega)$-bounded" (that is, for all $t\in \mathbb N$, the class of all…

Combinatorics · Mathematics 2026-05-05 Sepehr Hajebi , Sophie Spirkl

We compute the Selberg trace formula for Hecke operators (also called the trace formula for modular correspondences) in the context of cocompact Kleinian groups with finite-dimentional unitary representations. We give some applications to…

Number Theory · Mathematics 2007-11-01 Joshua S. Friedman

We prove the exponential growth of the cardinality of the set of numbers of spanning trees in simple (and planar) graphs on $n$ vertices, answering a question of Sedl\'a\v{c}ek from 1969. The proof uses a connection with continued…

Combinatorics · Mathematics 2025-07-02 Swee Hong Chan , Alex Kontorovich , Igor Pak

A mathematical model is formulated for the evolution of plane perturbations in a cosmological two-component statistical system of completely degenerate scalarly charged fermions with an asymmetric scalar Higgs interaction. A complete closed…

General Relativity and Quantum Cosmology · Physics 2023-02-08 Yu. G. Ignat'ev

We recapture Kuperberg's numerical invariant of 3-manifolds associated to a semisimple and cosemisimple Hopf algebra through a `planar algebra construction'. A result of possibly independent interest, used during the proof, which relates…

Quantum Algebra · Mathematics 2007-05-23 Vijay Kodiyalam , V. S. Sunder

Two classes of stringy instanton effects, stronger than standard field theory instantons, are identified in the heterotic string theory. These contributions are established using type IIA/heterotic and type I/heterotic dualities. They…

High Energy Physics - Theory · Physics 2009-10-30 Eva Silverstein

We obtain a combinatorial formula related to the shear transformation for semi-invariants of binary forms, which implies the classical characterization of semi-invariants in terms of a differential operator. Then, we present a combinatorial…

Combinatorics · Mathematics 2021-09-15 William Y. C. Chen , Ivy D. D. Jia

The computational complexity of time-dependent perturbation theory is well-known to be largely combinatorial whatever the chosen expansion method and family of parameters (combinatorial sequences, Goldstone and other Feynman-type…

Strongly Correlated Electrons · Physics 2010-07-26 Christian Brouder , Ângela Mestre , Frédéric Patras