English
Related papers

Related papers: A disjoint union theorem for trees

200 papers

We present a new approach to the following meta-problem: given a quantitative property of trees, design a type system such that the desired property for the tree generated by an infinitary ground lambda-term corresponds to some property of…

Logic in Computer Science · Computer Science 2017-03-31 Paweł Parys

We prove a density version of the Halpern-L\"{a}uchli Theorem. This settles in the affirmative a conjecture of R. Laver. Specifically, let us say that a tree $T$ is homogeneous if $T$ has a unique root and there exists an integer $b\meg 2$…

Combinatorics · Mathematics 2014-10-23 Pandelis Dodos , Vassilis Kanellopoulos , Nikolaos Karagiannis

For a labelled tree on the vertex set $[n]:=\{1,2,..., n\}$, define the direction of each edge $ij$ to be $i\to j$ if $i<j$. The indegree sequence of $T$ can be considered as a partition $\lambda \vdash n-1$. The enumeration of trees with a…

Combinatorics · Mathematics 2009-04-02 Rosena R. X. Du , Jingbin Yin

The longstanding conjecture of Halin characterizing the existence of normal spanning trees in infinite graphs has been recently proved by Max Pitz [3]. A critical step in the proof involves the construction of dominated torsos, whose…

Combinatorics · Mathematics 2026-03-31 Jerzy Wojciechowski

Teminal Wiener index is one of the commonly used topological index in mathematical chemistry. If two or more chemical compounds have the same terminal Wiener index then they will have similar physico-chemical properties. In this work we…

Discrete Mathematics · Computer Science 2021-11-30 Sulphikar A

Termination property of functions is an important issue in computability theory. In this paper, we show that repeated iterations of a function can induce an order amongst the elements of its domain set. Hasse diagram of the poset, thus…

Logic in Computer Science · Computer Science 2017-08-17 Abhinav Aggarwal , Padam Kumar

The Farrell-Jones Fibered Isomorphism Conjecture for the stable topological pseudoisotopy theory has been proved for several classes of groups. For example for discrete subgroups of Lie groups, virtually poly-infinite cyclic groups, Artin…

K-Theory and Homology · Mathematics 2011-03-03 S. K. Roushon

Let \Gamma be a geometrically finite tree lattice. We prove a Khintchine-Sullivan type theorem for the Hausdorff measure of the points at infinity of the tree that are well approximated by the parabolic fixed points of G. Using Bruhat-Tits…

Group Theory · Mathematics 2007-05-23 Sa'ar Hersonsky , Frederic Paulin

We explore from an algebraic viewpoint the properties of the tree languages definable with a first-order formula involving the ancestor predicate, using the description of these languages as those recognized by iterated block products of…

Formal Languages and Automata Theory · Computer Science 2018-12-06 Martin Beaudry

We prove a discretized Product Theorem for general simple Lie groups, in the spirit of Bourgain's Discretized Sum-Product Theorem.

Representation Theory · Mathematics 2014-05-09 Nicolas de Saxcé

We extend the theorem of Liouville on integration in finite terms to include dilogarithmic integrals. The results provide a necessary and sufficient condition for an element of the base field to have an antiderivative in a field extension…

General Mathematics · Mathematics 2022-01-26 Yashpreet Kaur , Varadharaj R. Srinivasan

The search of spanning trees with interesting disjunction properties has led to the introduction of edge-disjoint spanning trees, independent spanning trees and more recently completely independent spanning trees. We group together these…

Discrete Mathematics · Computer Science 2017-02-28 Benoit Darties , Nicolas Gastineau , Olivier Togni

We provide a formulation of the univalence axiom in a universe category model of dependent type theory that is convenient to verify in homotopy-theoretic settings. We further develop a strengthening of the univalence axiom, called pointed…

Logic in Computer Science · Computer Science 2025-12-19 Chris Kapulkin , Yufeng Li

We prove joint universality theorems on the half plane of absolute convergence for general classes of Dirichlet series with an Euler-product, where in addition to vertical shifts we also allow scaling. This generalizes our recent joint…

Number Theory · Mathematics 2020-08-14 Johan Andersson

The precise formulation of derivation for tree-adjoining grammars has important ramifications for a wide variety of uses of the formalism, from syntactic analysis to semantic interpretation and statistical language modeling. We argue that…

cmp-lg · Computer Science 2009-09-25 Yves Schabes , Stuart M. Shieber

We offer streamlined proofs of fundamental theorems regarding the index theory for partial self-maps of an infinite set that are bijective between cofinite subsets.

Combinatorics · Mathematics 2015-10-09 P. L. Robinson

We provide a fundamental result for bucket increasing trees, which gives a complete characterization of all families of bucket increasing trees that can be generated by a tree evolution process. We also provide several equivalent…

Combinatorics · Mathematics 2022-06-14 Markus Kuba , Alois Panholzer

We prove the A-theoretic Isomorphism Conjecture with coefficients and finite wreath products for solvable groups.

K-Theory and Homology · Mathematics 2017-10-10 F. Thomas Farrell , Xiaolei Wu

The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, and beyond. The purpose of this paper is to illustrate the…

Logic in Computer Science · Computer Science 2007-05-23 Thomas Colcombet

We give a short elementary proof of Tutte and Nash-Williams' characterization of graphs with k edge-disjoint spanning trees.

Combinatorics · Mathematics 2012-03-07 Tomáš Kaiser