Related papers: Generic Selective Independent Families
The $\lambda$-exponential family generalizes the standard exponential family via a generalized convex duality motivated by optimal transport. It is the constant-curvature analogue of the exponential family from the information-geometric…
We develop a family of simple rank one theories built over quite arbitrary sequences of finite hypergraphs. (This extends an idea from the recent proof that Keisler's order has continuum many classes, however, the construction does not…
Let $S$ be a rational fraction and let $f$ be a polynomial over a finite field. Consider the transform $T(f)=\operatorname{numerator}(f(S))$. In certain cases, the polynomials $f$, $T(f)$, $T(T(f))\dots$ are all irreducible. For instance,…
Let $i_t(G)$ be the number of independent sets of size $t$ in a graph $G$. Engbers and Galvin asked how large $i_t(G)$ could be in graphs with minimum degree at least $\delta$. They further conjectured that when $n\geq 2\delta$ and $t\geq…
We find a strong separation between two natural families of simple rank one theories in Keisler's order: the theories $T_\mathfrak{m}$ reflecting graph sequences, which witness that Keisler's order has the maximum number of classes, and the…
We show that there are no infinite maximal almost disjoint ("mad") families in Solovay's model, thus solving a long-standing problem posed by A.D.R. Mathias in 1967. We also give a new proof of Mathias' theorem that no analytic infinite…
In the note we construct a family of \'etale coverings of the affine line. More specifically, let $F$ be a finite field of characteristic $p$ and suppose that the cardinality of $F$ is at least 4. Let $A = F[T]$ be the polynomial ring in…
A line packing is optimal if its coherence is as small as possible. Most interesting examples of optimal line packings are achieving equality in some of the known lower bounds for coherence. In this paper two infinite families of real and…
We continue investigating the structure of externally definable sets in NIP theories and preservation of NIP after expanding by new predicates. Most importantly: types over finite sets are uniformly definable; over a model, a family of…
We present families of pairs of finite von Neumann algebras $A\subset M$ where $A$ is a maximal injective masa in the type $\mathrm{II}_1$ factor $M$ with separable predual. Our results make use of the strong mixing and the asymptotic…
We give a self-contained proof of the strongest version of Mason's conjecture, namely that for any matroid the sequence of the number of independent sets of given sizes is ultra log-concave. To do this, we introduce a class of polynomials,…
While persistent homology has taken strides towards becoming a wide-spread tool for data analysis, multidimensional persistence has proven more difficult to apply. One reason is the serious drawback of no longer having a concise and…
Ancestral graph models, introduced by Richardson and Spirtes (2002), generalize both Markov random fields and Bayesian networks to a class of graphs with a global Markov property that is closed under conditioning and marginalization. By…
We define and undertake a systematic study of thick, syndetic, and piecewise syndetic subsets of a Fra\"iss\'e structure. Each of these collections forms a family in the sense of Akin and Glasner [AG], and we define and study ultrafilters…
Our main objective is to show that the computational methods that we previously developed to search for difference families in cyclic groups can be fully extended to the more general case of arbitrary finite abelian groups. In particular…
Strong external difference families (SEDFs) were introduced by Paterson and Stinson as a more restrictive version of external difference families. SEDFs can be used to produce optimal strong algebraic manipulation detection codes. In this…
The versatility of exponential families, along with their attendant convexity properties, make them a popular and effective statistical model. A central issue is learning these models in high-dimensions, such as when there is some sparsity…
Pilgrim's Finite Global Attractor Conjecture has been verified for polynomials [1], but remains open for general rational maps. In this paper, we prove the conjecture for a family of rational maps obtained by gluing two PCF polynomials…
Whiteley \cite{wh} gives a complete characterization of the infinitesimal flexes of complete bipartite frameworks. Our work generalizes a specific infinitesimal flex to include joined graphs, a family of graphs that contain the complete…
We propose a family of "exactly solvable" probability distributions to approximate partition functions of two-dimensional statistical mechanics models. While these distributions lie strictly outside the mean-field framework, their free…