English
Related papers

Related papers: A disjoint union theorem for trees

200 papers

We consider finite range Gibbs fields and provide a purely combinatorial proof of the exponential tree decay of semi--invariants, supposing that the logarithm of the partition function can be expressed as a sum of suitable local functions…

Statistical Mechanics · Physics 2015-05-30 L. Bertini , Emilio N. M. Cirillo , E. Olivieri

We provide a bijection between the set of factorizations, that is, ordered (n-1)-tuples of transpositions in ${\mathcal S}_{n}$ whose product is (12...n), and labelled trees on $n$ vertices. We prove a refinement of a theorem of D\'{e}nes…

Combinatorics · Mathematics 2016-09-07 Ian Goulden , Alexander Yong

We prove that any disjoint union of finitely many simple curves in the upper half-plane can be generated in a unique way by the chordal multiple-slit Loewner equation with constant weights.

Complex Variables · Mathematics 2014-02-03 Oliver Roth , Sebastian Schleißinger

We prove a coherence theorem for actions of groups on monoidal categories. As an application we prove coherence for arbitrary braided $G$-crossed categories.

Quantum Algebra · Mathematics 2017-07-14 César Galindo

We give a short proof of Cayley's tree formula for counting the number of different labeled trees on $n$ vertices. The following nonlinear recursive relation for the number of labeled trees on $n$ vertices is deduced from a combinatorial…

Combinatorics · Mathematics 2022-12-22 Alok Bhushan Shukla

We present a new definition of non-ambiguous trees (NATs) as labelled binary trees. We thus get a differential equation whose solution can be described combinatorially. This yield a new formula for the number of NATs. We also obtain…

We show the Graceful Tree Conjecture holds.

Discrete Mathematics · Computer Science 2010-08-02 Jesse Gilbert

We provide decidability and undecidability results on the model-checking problem for infinite tree structures. These tree structures are built from sequences of elements of infinite relational structures. More precisely, we deal with the…

Logic in Computer Science · Computer Science 2011-11-15 Alex Spelten , Wolfgang Thomas , Sarah Winter

In this paper we show that there is an infinite set of points of contact between the set of all Dirichlet's series and Fermat-Wiles theorem. The proof is independent on the Jacob's ladders.

Number Theory · Mathematics 2024-12-18 Jan Moser

In this paper, we extend the notion of (word) derivatives and partial derivatives due to (respectively) Brzozowski and Antimirov to tree derivatives using already known inductive formulae of quotients. We define a new family of extended…

Formal Languages and Automata Theory · Computer Science 2021-07-29 Samira Attou , Ludovic Mignot , Djelloul Ziadi

The purpose of this work is to define a derived Hall algebra $\mathcal{DH}(T)$, associated to any dg-category $T$ (under some finiteness conditions). Our main theorem states that $\mathcal{DH}(T)$ is associative and unital. It is shown that…

Quantum Algebra · Mathematics 2007-05-23 B. Toen

We prove an equivalence between the derived category of a variety and the equivariant/graded singularity category of a corresponding singular variety. The equivalence also holds at the dg level.

Algebraic Geometry · Mathematics 2010-11-08 M. Umut Isik

We consider a dichotomy for analytic families of trees stating that either there is a colouring of the nodes for which all but finitely many levels of every tree are nonhomogeneous, or else the family contains an uncountable antichain. This…

Logic · Mathematics 2008-08-12 James Hirschorn

By considering the parity of the degrees and levels of nodes in increasing trees, a new combinatorial interpretation for the coefficients of the Taylor expansions of the Jacobi elliptic functions is found. As one application of this new…

Combinatorics · Mathematics 2021-09-15 Zhicong Lin , Jun Ma

In this paper, we consider the edge disjoint caterpillar realizations of tree degree sequences. We give the necessary and sufficient conditions when two tree degree sequences have edge disjoint caterpillar realizations. We conjecture that…

Combinatorics · Mathematics 2019-05-16 István Miklós , Geneva Schlafly , Yuheng Wang , Zhangyang Wei

We prove a uniform estimate of the number of points for difference algebraic varieties in finite difference fields in the spirit of Lang-Weil. More precisely, we give uniform lower and upper bounds for the number of rational points of a…

Number Theory · Mathematics 2024-06-04 Martin Hils , Ehud Hrushovski , Jinhe Ye , Tingxiang Zou

An abstract, Hales-Jewett type extension of the polynomial van der Waerden Theorem [J. Amer. Math. Soc. 9 (1996),725-753] is established: Theorem. Let r,d,q \in \N. There exists N \in \N such that for any r-coloring of the set of subsets of…

Combinatorics · Mathematics 2016-09-07 Vitaly Bergelson , Alexander Leibman

We define and provide some basic analysis of various types of crossed products by semimultiplicative sets, and then prove a $KK$-theoretical descent homomorphisms for semimultiplicative sets in accord with the descent homomorphism for…

Operator Algebras · Mathematics 2011-11-18 Bernhard Burgstaller

The theory of Ihara zeta functions is extended to non-compact arithmetic quotients of Bruhat-Tits trees. This new zeta function turns out to be a rational function, despite the infinite-dimensional setting. In general it has zeros and…

Number Theory · Mathematics 2017-06-13 Antonius Deitmar , Ming-Hsuan Kang

We show that products of sufficiently thick Cantor sets generate trees in the plane with constant distance between adjacent vertices. Moreover, we prove that the set of choices for this distance has non-empty interior. We allow our trees to…

Classical Analysis and ODEs · Mathematics 2024-11-20 Alex McDonald , Krystal Taylor