Related papers: On the Antichain Tree Property
Taking a Feynman categorical perspective, several key aspects of the geometry of surfaces are deduced from combinatorial constructions with graphs. This provides a direct route from combinatorics of graphs to string topology operations via…
We introduce a framework for constructing fractal trees via analytic generator fields, replacing discrete affine transformations and symbolic rewriting rules by the integration of smooth vector fields in an internal state space. In this…
Let p be a real number with 1<p and different from 2. We study Property (T_lp) for a second countable locally compact group G. Property (T_lp) is a weak version of Kazhdan's Property (T), defined in terms of the orthogonal representations…
We study the problem of decomposing (clustering) a tree with respect to costs attributed to pairs of nodes, so as to minimize the sum of costs for those pairs of nodes that are in the same component (cluster). For the general case and for…
We consider a problem of enumerating chemical graphs from given constraints concerning their structures, which has an important application to a novel method for the inverse QSAR/QSPR recently proposed. In this paper, the structure of a…
We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…
We prove complex contraction for zero-free regions of counting weighted set cover problem in which an element can appear in an unbounded number of sets, thus obtaining fully polynomial-time approximation schemes(FPTAS) via Barvinok's…
In todays world there is a wide availability of huge amount of data and thus there is a need for turning this data into useful information which is referred to as knowledge. This demand for knowledge discovery process has led to the…
Manipulating downward-closed sets of vectors forms the basis of so-called antichain-based algorithms in verification. In that context, the dimension of the vectors is intimately tied to the size of the input structure to be verified. In…
Critical infrastructure systems - for which high reliability and availability are paramount - must operate securely. Attack trees (ATs) are hierarchical diagrams that offer a flexible modelling language used to assess how systems can be…
We investigate the class of FHP theories, i.e. theories of structures in which all definable families of sets satisfy the Fractional Helly Property (and its variants) from combinatorics. FHP theories generalize NIP and form a new subclass…
For an arbitrary field $K$ and $K$-variety $V$, we introduce the \'etale-open topology on the set $V(K)$ of $K$-points of $V$. This topology agrees with the Zariski topology, Euclidean topology, or valuation topology when $K$ is separably…
We introduce an efficient way, called Newton algorithm, to study arbitrary ideals in C[[x,y]], using a finite succession of Newton polygons. We codify most of the data of the algorithm in a useful combinatorial object, the Newton tree. For…
In this paper, we define a new notion of "freely tracing property by free chains" on $G$-like continua and we prove that a positive topological entropy homeomorphism on a $G$-like continuum admits a Cantor set $Z$ such that every tuple of…
We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and…
For an arbitrary valued field $(K,v)$ and a given extension $v(K^*)\hookrightarrow\Lambda$ of ordered groups, we analyze the structure of the tree formed by all $\Lambda$-valued extensions of $v$ to the polynomial ring $K[x]$. As an…
We prove that the common theory of nonabelian free groups has the dimensional order property, or DOP, implying, for example, that there is no reasonable structure theorem for $\aleph_1$-saturated models of this theory.
Hyperproperties enable simultaneous reasoning about multiple execution traces of a system and are useful to reason about non-interference, opacity, robustness, fairness, observational determinism, etc. We introduce hyper parametric timed…
Following Natanzon-Zabrodin, we explore the Kadomtsev-Petviashvili hierarchy as an infinite system of mutually consistent relations on the second derivatives of the free energy with some universal coefficients. From this point of view,…
We give a characterisation of quantum automorphism groups of trees. In particular, for every tree, we show how to iteratively construct its quantum automorphism group using free products and free wreath products. This can be considered a…