English
Related papers

Related papers: Infinite trees

200 papers

We prove the existence of infinite dense free sets (in the usual topology) for set mappings on the reals, under reasonable assumptions.

Logic · Mathematics 2016-11-15 Shimon Garti

The hypothesis concerning the off-site continuum existence is investigated from the point of view of the mathematical theory of sets. The principles and methods of the mathematical description of the physical objects from different off-site…

General Physics · Physics 2007-06-04 A. V. Novikov-Borodin

Expanded lecture notes. Preliminary version, comments are welcome.

Combinatorics · Mathematics 2018-05-31 Bogdan Nica

We continue the study of how one can define means of infinite sets. We introduce many new properties, investigate their relations to each other and how they can typify a mean. We collect the properties in property groups e.g. for…

Classical Analysis and ODEs · Mathematics 2018-09-27 Attila Losonczi

Periodic trees are combinatorial structures which are in bijection with cluster tilting objects in cluster categories of affine type $\tilde{A}_{n-1}$. The internal edges of the tree encode the $c$-vectors corresponding to the cluster…

Representation Theory · Mathematics 2014-07-03 Kiyoshi Igusa , Gordana Todorov , Jerzy Weyman

Some aspects of analysis on disconnected sets are briefly discussed, more along the lines of regions with infinitely many components than Cantor sets.

Classical Analysis and ODEs · Mathematics 2007-09-10 Stephen Semmes

We investigate clique trees of infinite locally finite chordal graphs. Our main contribution is a bijection between the set of clique trees and the product of local finite families of finite trees. Even more, the edges of a clique tree are…

Combinatorics · Mathematics 2018-03-23 Christoph Hofer-Temmel , Florian Lehner

A new construction of naturally reductive spaces is presented. This construction gives a large amount of new families of naturally reductive spaces. First the infinitesimal models of the new naturally reductive spaces are constructed. A…

Differential Geometry · Mathematics 2016-05-03 Reinier Storm

We study effective randomness-preserving transformations of path-incompressible trees. Some path-incompressible trees with infinitely many paths do not compute perfect path-random trees with computable oracle-use. Sparse perfect…

Combinatorics · Mathematics 2024-01-11 George Barmpalias , Xiaoyan Zhang

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

The last decade has witnessed a growing interest in random forest models which are recognized to exhibit good practical performance, especially in high-dimensional settings. On the theoretical side, however, their predictive power remains…

Statistics Theory · Mathematics 2014-09-09 Erwan Scornet

The family of trees with palindromic characteristic polynomials is characterized. Large families of graphs with this property are found as well.

Combinatorics · Mathematics 2022-12-09 Tadashi Akagi , Eduardo A. Canale

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

Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…

General Mathematics · Mathematics 2007-05-23 W. Mueckenheim

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…

Logic in Computer Science · Computer Science 2017-01-20 Paweł Parys

We look for partition theorems for large subtrees for suitable uncountable trees and colourings. We concentrate on sub-trees of $^{\kappa \ge} 2$ expanded by a well ordering of each level. Unlike earlier works, we do not ask the embedding…

Logic · Mathematics 2026-01-06 Saharon Shelah

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

One of the main virtues of trees is to represent formal solutions of various functional equations which can be cast in the form of fixed point problems. Basic examples include differential equations and functional (Lagrange) inversion in…

Combinatorics · Mathematics 2013-02-12 Florent Hivert , Jean-Christophe Novelli , Jean-Yves Thibon

We present several philosophical ideas emerging from the studies of complex systems. We make a brief introduction to the basic concepts of complex systems, for then defining "abstraction levels". These are useful for representing…

Adaptation and Self-Organizing Systems · Physics 2007-05-23 Carlos Gershenson

There are different concepts regarding to tree decomposition of a graph $G$. For the Hypercube $Q_n$, these concepts have been shown to have many applications. But some diverse papers on this subject make it difficult to follow what is…

Combinatorics · Mathematics 2021-01-11 Negin Karisani , E. S. Mahmoodian
‹ Prev 1 4 5 6 7 8 10 Next ›