Related papers: A disjoint union theorem for trees

Tangle-tree theorems are an important tool in structural graph theory, and abstract separation systems are a very general setting in which tangle-tree theorems can still be formulated and proven. For infinite abstract separation systems, so…

We prove an accessibility theorem for finite-index splittings of groups. Given a finitely presented group G there is a number n(G) such that, for every reduced locally finite G-tree T with finitely generated stabilizers, T/G has at most…

We extend the classical construction by Noether of crossed product algebras, defined by finite Galois field extensions, to cover the case of separable (but not necessarily finite or normal) field extensions. This leads us naturally to…

We prove a coherence theorem for invertible objects in a symmetric monoidal category. This is used to deduce associativity, skew-commutativity, and related results for multi-graded morphism rings, generalizing the well-known versions for…

In this paper, we prove a Morse index theorem for the index form of even order linear Hamiltonian systems on the closed interval with reasonable self-adjoint boundary conditions. The highest order term is assumed to be nondegenerate.

We consider a family of infinite sums of products of Catalan numbers, indexed by trees. We show that these sums are polynomials in $1/\pi$ with rational coefficients; the proof is effective and provides an algorithm to explicitly compute…

We give a proof for sharp estimate for the number of spanning trees using linear algebra and generalize this bound to multigraphs. In addition, we show that this bound is tight for complete graphs. In addition, we give estimates for number…

Using Gillet's technique of projective envelopes, we prove a homological descent theorem for the connective K-homology of schemes.

This is an introduction to the theory of disconjugacy for a second order linear differential equation. We give new proofs of some of basic results and obtain new sufficient conditions for disconjugacy (in particular, on the whole real…

The paper is devoted to prove a version of Milnor-Moore Theorem for connected braided bialgebras that are infinitesimally cocommutative. Namely in characteristic different from 2, we prove that, for a given connected braided bialgebra $A$…

We prove a refinement of the tree packing theorem by Tutte/Nash-Williams for finite graphs. This result is used to obtain a similar result for end faithful spanning tree packings in certain infinite graphs and consequently to establish a…

We develop a Van der Waerden type theorem in an axiomatic setting of graded lattices and show that this axiomatic formulation can be applied to various lattices, for instance the set partition and the Boolean lattices. We derive the…

We prove the finite generation of the adjoint ring for $\mathbb{Q}$-factorial log surfaces over any algebraically closed field.

We prove a version of $Z$-set unknotting theorem for uncountable products of real numbers.

We introduce the Dichotomy Property, a new property of some languages in Set Computable Theory, in order to explore the expressivity of some languages which are extensions of MLS. By-product we prove undecidability of MLS extended with not…

We prove asymptotic normality for the number of fringe subtrees isomorphic to any given tree in uniformly random trees with given vertex degrees. As applications, we also prove corresponding results for random labelled trees with given…

In this article we propose a general method of obtaining infinite sums of products with functions that count patterns in numbers.

We generalize the notions of composition series and composition factors for profinite groups, and prove a profinite version of the Jordan-Holder Theorem. We apply this to prove a Galois Theorem for infinite prosolvable extensions. In…

We present a generalization of Wigner's unitary-antiunitary theorem for pairs of ray transformations. As a particular case, we get a new Wigner-type theorem for non-Hermitian indefinite inner product spaces.

We establish several results on the word problem for just infinite groups. First, for finitely generated just infinite groups we show that the word problem is uniformly decidable for presentations with recursively enumerable sets of…