Related papers: Background construction for $\lambda$-indexed mice
We establish primitive recursive versions of some known facts about computable ordered fields of reals and computable reals, and then apply them to proving primitive recursiveness of some natural problems in linear algebra and analysis. In…
We define the generalized Golomb triangular recursion by g_{j,s,lambda}(n) = g_{j,s,lambda}(n - s - g_{j,s,lambda}(n-j)) + \lambda j. For particular choices of the initial conditions, we show that the solution of the recursion is a non-slow…
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…
We consider how to index strings, trees and graphs for jumbled pattern matching when we are asked to return a match if one exists. For example, we show how, given a tree containing two colours, we can build a quadratic-space index with…
This paper addresses the representation theory of the insertion-elimination Lie algebra, a Lie algebra that can be naturally realized in terms of tree-inserting and tree-eliminating operations on rooted trees. The insertion-elimination…
In this paper we introduce the class of graded Poisson color algebras as the natural generalization of graded Poisson algebras and graded Poisson superalgebras. For $\Lambda$ an arbitrary abelian group, we show that any of such…
The Ising spin - S model on recursive p - polygonal structures in the external magnetic field is considered and the general form of the free energy and magnetization for arbitrary spin is derived. The exact relation between the free…
We introduce a novel combinatorial structure called pointed building sets, which can be viewed as families of lattices equipped with compatibility relations. To each pointed building set $\mathsf{B}$, we associate a complete lattice…
XML document markup is highly repetitive and therefore well compressible using dictionary-based methods such as DAGs or grammars. In the context of selectivity estimation, grammar-compressed trees were used before as synopsis for structural…
This paper presents a detailed symbolic approach to the study of self-similar tilings. It uses properties of addresses associated with graph-directed iterated function systems to establish conjugacy properties of tiling spaces. Tiles may be…
We study polynomial families {f_n(x)}_{n>=0} over a commutative ring R encoded by triangular arrays of order m, via expansions of the form f_n(x)=sum_{b=0}^{floor(n/m)} lambda_1(n,b) x^{n-mb}, where lambda_1 is the direct kernel supported…
Tree structured graphical models are powerful at expressing long range or hierarchical dependency among many variables, and have been widely applied in different areas of computer science and statistics. However, existing methods for…
This paper continues the study of the Ramsey-like large cardinals. Ramsey-like cardinals are defined by generalizing the characterization of Ramsey cardinals via the existence of elementary embeddings. Ultrafilters derived from such…
We study the class structure of finite-alphabet Markov chains with arbitrary memory length. To capture the structural constraints induced by prohibited transitions, we introduce the skeleton of a higher-order transition kernel, defined as a…
In this work we demonstrate the ability of the Minimal Spanning Tree to duplicate the information contained within a percolation analysis for a point dataset. We show how to construct the percolation properties from the Minimal Spanning…
We describe a combinatorial approach for investigating properties of rational numbers. The overall approach rests on structural bijections between rational numbers and familiar combinatorial objects, namely rooted trees. We emphasize that…
We develop some applications of certain algebraic and combinatorial conditions on the elements of Coxeter groups, such as elementary proofs of the positivity of certain structure constants for the associated Kazhdan--Lusztig basis. We also…
We prove that if there is an elementary embedding from the universe to itself, then there is a proper class of measurable successor cardinals.
We give unique recovery guarantees for matrices of bounded rank that have undergone permutations of their entries. We even do this for a more general matrix structure that we call ladder matrices. We use methods and results of commutative…
If T is an iteration tree on K and F is a countably certified extender that coheres with the final model of T, then F is on the extender sequence of the final model of T. Several applications of maximality are proved, including: o K…