Related papers: On the Antichain Tree Property
We study vantage-point trees constructed using an independent sample from the uniform distribution on a fixed convex body $K$ in $(\mathbb{R}^d,\|\cdot\|)$, where $\|\cdot\|$ is an arbitrary norm on $\mathbb{R}^d$. We prove that a sequence…
The fundamental tension between availability and consistency shapes the design of distributed storage systems. Classical results capture extreme points of this trade-off: the CAP theorem shows that strong models like linearizability…
Tree sets are posets with additional structure that generalize tree-like objects in graphs, matroids, or other combinatorial structures. They are a special class of abstract separation systems. We study infinite tree sets and how they…
Motivated by a concept studied in [1], we consider a property of matrices over finite fields that generalizes triangular totally nonsingular matrices to block matrices. We show that (1) matrices with this property suffice to construct good…
We prove that in a countable theory T fully stable over a predicate P, any complete set A has the existence property. This means that A can be extended to a model of T without changing the P-part. In particular, T has the Gaifman property:…
We obtain structure theorems for graphs excluding a fan (a path with a universal vertex) or a dipole ($K_{2,k}$) as a topological minor. The corresponding decompositions can be computed in FPT linear time. This is motivated by the study of…
Let $X$ be a finite set. We give criterion to say if a system of trees ${\cal P}=\{T_i\}_i$ with leaf sets $L(T_i) \in {X \choose 5}$ can be amalgamated into a supertree, that is, if there exists a tree $T$ with $L(T)=X$ such that $T$…
(CROPPED TO FIT IN ARXIV'S SILLY LIMIT. SEE PDF FOR COMPLETE ABSTRACT.) We are the first to thoroughly explore a large space of formal secure compilation criteria based on robust property preservation, i.e., the preservation of properties…
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…
A non-commutative, planar, Hopf algebra of rooted trees was proposed in L. Foissy, Bull. Sci. Math. 126 (2002) 193-239. In this paper we propose such a non-commutative Hopf algebra for graphs. In order to define a non-commutative product we…
Conceptual combination is a cognitive process that merges basic concepts, enabling the creation of complex expressions. During this process, the properties of combination (e.g., the whiteness of a peeled apple) can be inherited from basic…
With the help of various square principles, we obtain results concerning the consistency strength of several statements about trees containing ascent paths, special trees, and strong chain conditions. Building on a result that shows that…
Given a user-specified minimum correlation threshold and a transaction database, the problem of mining all-strong correlated pairs is to find all item pairs with Pearson's correlation coefficients above the threshold . Despite the use of…
Recently, Graph Transformer (GT) models have been widely used in the task of Molecular Property Prediction (MPP) due to their high reliability in characterizing the latent relationship among graph nodes (i.e., the atoms in a molecule).…
We establish a new spectral criterion for Kazhdan's property $(T)$ which is applicable to a large class of discrete groups defined by generators and relations. As the main application, we prove property $(T)$ for the groups $EL_n(R)$, where…
This paper proposes FREEtree, a tree-based method for high dimensional longitudinal data with correlated features. Popular machine learning approaches, like Random Forests, commonly used for variable selection do not perform well when there…
In this note, we prove that Kim-dividing over models is always witnessed by a coheir Morley sequence in NATP theories. Following the strategy of Chernikov and Kaplan [8], we obtain some corollaries which hold in NATP theories. Namely, (i)…
Proteins typically exist in complexes, interacting with other proteins or biomolecules to perform their specific biological roles. Research on single-chain protein modeling has been extensively and deeply explored, with advancements seen in…
Tree trace reconstruction aims to learn the binary node labels of a tree, given independent samples of the tree passed through an appropriately defined deletion channel. In recent work, Davies, R\'acz, and Rashtchian used combinatorial…
Tree projections provide a unifying framework to deal with most structural decomposition methods of constraint satisfaction problems (CSPs). Within this framework, a CSP instance is decomposed into a number of sub-problems, called views,…