English
Related papers

Related papers: Bi-invariant types, reliably invariant types, and …

200 papers

Binary trait data record the presence or absence of distinguishing traits in individuals. We treat the problem of estimating ancestral trees with time depth from binary trait data. Simple analysis of such data is problematic. Each homology…

Methodology · Statistics 2009-08-31 Geoff K. Nicholls , Russell D. Gray

The paper develops a rather unexpected parallel to the multivariate Matsumoto--Yor (MY) property on trees considered in \cite{MW04}. The parallel concerns a multivariate version of the Kummer distribution, which is generated by a tree.…

Probability · Mathematics 2017-05-30 Agnieszka Piliszek , Jacek Wesołowski

We describe in this note a new invariant of rooted trees. We argue that the invariant is interesting on it own, and that it has connections to knot theory and homological algebra. However, the real reason that we propose this invariant to…

Combinatorics · Mathematics 2015-12-11 Jozef H. Przytycki

We study the conservativity of extensions by additional strict equalities of dependent type theories (and more general second-order generalized algebraic theories). The conservativity of Extensional Type Theory over Intensional Type Theory…

Logic in Computer Science · Computer Science 2023-04-21 Rafaël Bocquet

This paper presents a type theory in which it is possible to directly manipulate $n$-dimensional cubes (points, lines, squares, cubes, etc.) based on an interpretation of dependent type theory in a cubical set model. This enables new ways…

Logic in Computer Science · Computer Science 2016-11-14 Cyril Cohen , Thierry Coquand , Simon Huber , Anders Mörtberg

Interpreting three-leaf binary trees or {\em rooted triples} as constraints yields an entailment relation, whereby binary trees satisfying some rooted triples must also thus satisfy others, and thence a closure operator, which is known to…

Data Structures and Algorithms · Computer Science 2018-07-03 Matthew P. Johnson

We investigate some versions of amoeba for tree-forcings in the generalized Cantor and Baire spaces. This answers [10, Question 3.20] and generalizes a line of research that in the standard case has been studied in [11], [13], and [7].…

Logic · Mathematics 2020-08-13 Giorgio Laguzzi

We study preservation theorems for modal logics over finite structures with respect to three fundamental semantic relations: embeddings, injective homomorphisms, and homomorphisms. We focus on classes of pointed Kripke models that are…

Logic in Computer Science · Computer Science 2026-02-03 Przemysław Andrzej Wałęga , Bernardo Cuenca Grau

We present a model-theoretic property of finite structures, that can be seen to be a finitary analogue of the well-studied downward L\"owenheim-Skolem property from classical model theory. We call this property as the…

Logic in Computer Science · Computer Science 2017-05-15 Abhisekh Sankaran

The last decade has shed some light on theoretical properties such as their consistency for regression tasks. In the current paper, we propose a new class of very simple learners based on so-called naive trees. These naive trees partition…

Statistics Theory · Mathematics 2024-12-18 Nico Föge , Markus Pauly , Lena Schmid , Marc Ditzhaus

We give a proof of the Breuil-Schneider conjecture in a large number of cases, which complement the indecomposable case, which we dealt with earlier in [Sor]. In some sense, only the Steinberg representation lies at the intersection of the…

Number Theory · Mathematics 2016-01-20 Claus M. Sorensen

We confirm the quasi-projective case of Saito's conjecture, namely that the cohomological characteristic classes defined by Abbes and Saito can be computed in terms of the characteristic cycles. We construct a cohomological characteristic…

Algebraic Geometry · Mathematics 2025-02-18 Enlin Yang , Yigeng Zhao

Let $\mathsf{TT}^2_k$ denote the combinatorial principle stating that every $k$-coloring of pairs of compatible nodes in the full binary tree has a homogeneous solution, i.e. an isomorphic subtree in which all pairs of compatible nodes have…

Logic · Mathematics 2019-12-20 Chi Tat Chong , Wei Li , Lu Liu , Yue Yang

A tree is scattered if no subdivision of the complete binary tree is a subtree. Building on results of Halin, Polat and Sabidussi, we identify four types of subtrees of a scattered tree and a function of the tree into the integers at least…

Combinatorics · Mathematics 2016-10-03 Claude Laflamme , Maurice Pouzet , Norbert Sauer

We study approximate equivalence relations up to commensurability, in the presence of a definable measure. As a basic framework, we give a presentation of probability logic based on continuous logic. Hoover's normal form is valid here; if…

Logic · Mathematics 2024-07-30 Ehud Hrushovski

This paper derives a unifying theorem establishing consistency results for a broad class of tree-based algorithms. It improves current results in two aspects. First of all, it can be applied to algorithms that vary from traditional Random…

Statistics Theory · Mathematics 2024-02-22 Ricardo Blum , Munir Hiabu , Enno Mammen , Joseph T. Meyer

Kitaev's quantum double models in 2D provide some of the most commonly studied examples of topological quantum order. In particular, the ground space is thought to yield a quantum error-correcting code. We offer an explicit proof that this…

Implications are explored of promoting non-conformal scale-invariant theories to conformal theories by nonlinearly realizing the missing symmetry. Properties of the associated Nambu-Goldstone mode imply that conformal invariance cannot be…

High Energy Physics - Theory · Physics 2019-03-27 Takemichi Okui

This paper gives a uniform-theoretic refinement of classical homotopy theory. Both cubical sets (with connections) and uniform spaces admit classes of weak equivalences, special cases of classical weak equivalences, appropriate for the…

Algebraic Topology · Mathematics 2021-09-20 Sanjeevi Krishnan , Crichton Ogle

Two rooted locally finite trees are considered equivalent if both can be embedded into each other as topological minors by means of tree-order preserving mappings. By exploiting Nash-William's Theorem, Matthiesen provided a non-constructive…

Combinatorics · Mathematics 2016-04-18 J. Bruno