Related papers: Independence in generic incidence structures

We study algebraic and combinatorial aspects of (classical) projections of $m$-dimensional tropical varieties onto $(m+1)$-dimensional planes. Building upon the work of Sturmfels, Tevelev, and Yu on tropical elimination as well as the work…

We construct ensembles of random integrable matrices with any prescribed number of nontrivial integrals and formulate integrable matrix theory (IMT) -- a counterpart of random matrix theory (RMT) for quantum integrable models. A type-M…

In this paper, the $mn$-dimensional space of tensor-product polynomials of two variables, of degree at most $(m-1)+(n-1)$, is considered. A theory of two-variate polynomials is developed by establishing the algebra and basic algebraic…

Let K be an algebraically bounded structure and T be its theory. If T is model complete, then the theory of K endowed with a derivation, denoted by $T^{\delta}$, has a model completion. Additionally, we prove that if the theory T is…

We establish a bijection between marginal independence models on $n$ random variables and split closed order ideals in the poset of partial set partitions. We also establish that every discrete marginal independence model is toric in cdf…

An arbitrary dependence structure between a finite family of events of a probability space defines a hypergraph structure. We study the converse operation, starting from a hypergraph structure, to determine a canonical probability space…

We study Ising spin models on finitely connected random interaction graphs which are drawn from an ensemble in which not only the degree distribution $p(k)$ can be chosen arbitrarily, but which allows for further fine-tuning of the topology…

We call a pair $(m,f)$ of integers, $m\geq 1$, $0\leq f \leq \binom{m}{2}$, \emph{absolutely avoidable} if there is $n_0$ such that for any pair of integers $(n,e)$ with $n>n_0$ and $0\leq e\leq \binom{n}{2}$ there is a graph on $n$…

FI-graphs were introduced by the second author and White to capture the idea of a family of nested graphs, each member of which is acted on by a progressively larger symmetric group. That work was built on the newly minted foundations of…

Fix a positive integer $n$ and consider the bipartite graph whose vertices are the $3$-element subsets and the $2$-element subsets of $[n]=\{1,2,\dots,n\}$, and there is an edge between $A$ and $B$ if $A\subset B$. We prove that the…

A theorem of Ding, Oporowski, Oxley, and Vertigan implies that any sufficiently large twin-free graph contains a large matching, a co-matching, or a half-graph as a semi-induced subgraph. The sizes of these unavoidable patterns are measured…

In this paper, the connections between model theory and the theory of infinite permutation groups are used to study the n-existence and the n-uniqueness for n-amalgamation problems of stable theories. We show that, for any n>1, there exists…

Suppose that M is countable, binary, primitive, homogeneous, and simple, and hence 1-based. We prove that the SU-rank of the complete theory of M is~1. It follows that M is a random structure. The conclusion that M is a random structure…

Disjoint $n$-amalgamation is a condition on a complete first-order theory specifying that certain locally consistent families of types are also globally consistent. In this paper, we show that if a countably categorical theory $T$ admits an…

Let G be a graph. The independence-domination number is the maximum over all independent sets I in G of the minimal number of vertices needed to dominate I. In this paper we investigate the computational complexity of independence…

We introduce methods to count and enumerate all maximal independent, all maximum independent sets, and all independent sets in threshold graphs and k-threshold graphs. Within threshold graphs and k-threshold graphs independent sets…

Uniqueness and independence are two fundamental properties of data. Their enforcement in database systems can lead to higher quality data, faster data service response time, better data-driven decision making and knowledge discovery from…

The independence polynomial $i(G,x)$ of a graph $G$ is the generating function of the numbers of independent sets of each size. A graph of order $n$ is very well-covered if every maximal independent set has size $n/2$. Levit and Mandrescu…

Compositional graphoids are fundamental discrete structures which appear in probabilistic reasoning, particularly in the area of graphical models. They are semigraphoids which satisfy the Intersection and Composition properties. These…

Given a partition $V_1 \sqcup V_2 \sqcup \dots \sqcup V_m$ of the vertex set of a graph, we are interested in finding multiple disjoint independent sets that contain the correct fraction of vertices of each $V_j$. We give conditions for the…