Related papers: Maximal discrete sets
A family of subsets $\mathcal{F} \subseteq \mathcal{P}(\{1, 2, \ldots, n\})$ has the disparate union property if any two disjoint subfamilies $\mathcal{F}_1, \mathcal{F}_2 \subseteq \mathcal{F}$ have distinct unions $\bigcup \mathcal{F}_1…
Ron et al (1998) introduced a rich family of models for discrete longitudinal data, called acyclic probabilistic finite automata. These may be described as context-specific graphical models, since they are represented as directed…
Let $d \geq 2$ be an integer. We conjecture that there is a finitely generated perfect group whose homomorphic images include all finite $d$-generated perfect groups. We prove a special case of this conjecture for the finite perfect groups…
A space $X$ is submaximal if any dense subset of $X$ is open. In this paper, we prove that every submaximal topological gyrogroup of non-measurable cardinality is strongly $\sigma$-discrete. Moreover, we prove that every submaximal strongly…
For a family $\mathcal{F}$ of graphs, let $ex(n,\mathcal{F})$ denote the maximum number of edges in an $n$-vertex graph which contains none of the members of $\mathcal{F}$ as a subgraph. A longstanding problem in extremal graph theory asks…
We consider the problem of determining the maximum cardinality of a subset containing no arithmetic progressions of length $k$ in a given set of size $n$. It is proved that it is sufficient, in a certain sense, to consider the interval…
The majorization relation orders the degree sequences of simple graphs into posets called dominance orders. As shown by Ruch and Gutman (1979) and Merris (2002), the degree sequences of threshold and split graphs form upward-closed sets…
We study largest singular values of large random matrices, each with mean of a fixed rank $K$. Our main result is a limit theorem as the number of rows and columns approach infinity, while their ratio approaches a positive constant. It…
The extremal problems regarding the maximum possible size of intersecting families of various combinatorial objects have been extensively studied. In this paper, we investigate supersaturation extensions, which in this context ask for the…
Definable stationary sets, and specifically, ordinal definable ones, play a significant role in the study of canonical inner models of set theory and the class HOD of hereditarily ordinal definable sets. Fixing a certain notion of…
We consider spatial discretizations by the finite section method of the restricted group algebra of a finitely generated discrete group, which is represented as a concrete operator algebra via its left-regular representation. Special…
Submodular set functions are undoubtedly among the most important building blocks of combinatorial optimization. Somewhat surprisingly, continuous counterparts of such functions have also appeared in an analytic line of research where they…
We prove constructively that the maximum possible number of minimal connected dominating sets in a connected undirected graph of order $n$ is in $\Omega(1.489^n)$. This improves the previously known lower bound of $\Omega(1.4422^n)$ and…
We give conditions for determining the extremal behavior for the (graded) Betti numbers of squarefree monomial ideals. For the case of non-unique minima, we give several conditions which we use to produce infinite families, exponentially…
Theorem: There is a {\em complete sentence} $\phi$ of $L_{\omega_1,\omega}$ such that $\phi$ has maximal models in a set of cardinals $\lambda$ that is cofinal in the first measurable $\mu$ while $\phi$ has no maximal models in any $\chi…
G\'abor Elek introduced the notion of a hyperfinite graph family: a collection of graphs is hypefinite if for every $\epsilon>0$ there is some finite $k$ such that each graph $G$ in the collection can be broken into connected components of…
We consider partial symmetric Toeplitz matrices where a positive definite completion exists. We characterize those patterns where the maximum determinant completion is itself Toeplitz. We then extend these results with positive definite…
We investigate the Jacobian decomposition of some algebraic curves over finite fields with genus $4$, $5$ and $10$. As a corollary, explicit equations for curves that are either maximal or minimal over the finite field with $p^2$ elements…
A subset of vertices $F$ in a graph $G$ is called a \emph{dissociation set} if the induced subgraph $G[F]$ of $G$ has maximum degree at most 1. A \emph{maximal dissociation set} of $G$ is a dissociation set which is not a proper subset of…
A graph $G$ is $\textit{universal}$ for a (finite) family $\mathcal{H}$ of graphs if every $H \in \mathcal{H}$ is a subgraph of $G$. For a given family $\mathcal{H}$, the goal is to determine the smallest number of edges an…