Related papers: Almost Affinely Disjoint Subspaces
We propose new structures called almost o-minimal structures and $\mathfrak X$-structures. The former is a first-order expansion of a dense linear order without endpoints such that the intersection of a definable set with a bounded open…
A family of sets is called $r$-\emph{cover free} if no set in the family is contained in the union of $r$ (or less) other sets in the family. A $1$-cover free family is simply an antichain with respect to set inclusion. Thus, Sperner's…
We call a family G of subsets of [n] a k-generator of (\mathbb{P}[n]) if every (x \subset [n]) can be expressed as a union of at most k disjoint sets in (\mathcal{G}). Frein, Leveque and Sebo conjectured that for any (n \geq k), such a…
We show that every semigroup which is a finite disjoint union of copies of the free monogenic semigroup (natural numbers under addition) has linear growth. This implies that the the corresponding semigroup algebra is a PI algebra.
An affine semigroup is a finitely generated subsemigroup of $(\mathbb Z_{\ge 0}^d, +)$, and a numerical semigroup is an affine semigroup with $d = 1$. A growing body of recent work examines shifted families of numerical semigroups, that is,…
An $m \times n$ matrix $\mathsf{A}$ with column supports $\{S_i\}$ is $k$-separable if the disjunctions $\bigcup_{i \in \mathcal{K}} S_i$ are all distinct over all sets $\mathcal{K}$ of cardinality $k$. While a simple counting bound shows…
A quandle will be called quasi-affine, if it embeds into an affine quandle. Our main result is a characterization of quasi-affine quandles, by group-theoretic properties of their displacement group, by a universal algebraic condition coming…
We establish that the optimal bound for the size of the smallest integral solution of the Oppenheim Diophantine approximation problem $\abs{Q(x)-\xi}< \epsilon$ for a generic ternary form $Q$ is $\abs{x}\ll \epsilon^{-1}$. We also establish…
We classify all post-critically finite unicritical polynomials defined over the maximal totally real algebraic extension of ${\mathbb Q}$. Two auxiliary results used in the proof of this result may be of some independent interest. The first…
Codimension one webs are configurations of finitely many codimension one foliations in general position. Much of the classical theory evolved around the concept of abelian relation: a functional relation among the first integrals of the…
Quasiconformal maps are homeomorphisms with useful local distortion inequalities; infinitesimally, they map balls to ellipsoids with bounded eccentricity. This leads to a number of useful regularity properties, including quantitative…
Graduated locally finitely presentable categories are introduced, examples include categories of sets, vector spaces, posets, presheaves and Boolean algebras. A finitary functor between graduated locally finitely presentable categories is…
Given a countable transitive model $M$ for ZFC+CH, we prove that one can produce a maximal almost disjoint family in $M$ whose Vietoris Hyperspace of its Isbell-Mr\'owka space is pseudocompact on every Cohen extension of $M$. We also show…
Two families $\mathcal{F}$ and $\mathcal{G}$ of $k$-subsets of an $n$-set are called $s$-almost cross-$t$-intersecting if each member in $\mathcal{F}$ (resp. $\mathcal{G}$) is $t$-disjoint with at most $s$ members in $\mathcal{G}$ (resp.…
Basic algebraic and combinatorial properties of finite vector spaces in which individual vectors are allowed to have multiplicities larger than $ 1 $ are derived. An application in coding theory is illustrated by showing that multispace…
We study different form of boundness for ideals of almost Dedekind domains, generalizing the notions of critical ideals, radical factorization, and SP-domains. We show that every almost Dedekind domain has at least one noncritical maximal…
We answer Question~3.2 from Shelah \cite{Sh:666}: Given a maximal almost disjoint (mad) family $\mathcal A$ of size $\aleph_1$, we construct a forcing ${\mathbb Q}(\mathcal A)$ that has Axiom A, is ${}^\omega \omega$-bounding, preserves…
We study the family of intersection graphs of low density objects in low dimensional Euclidean space. This family is quite general, and includes planar graphs. We prove that such graphs have small separators. Next, we present efficient…
For positive integers $n>k>t$ let $\binom{[n]}{k}$ denote the collection of all $k$-subsets of the standard $n$-element set $[n]=\{1,\ldots,n\}$. Subsets of $\binom{[n]}{k}$ are called $k$-graphs. A $k$-graph $\mathcal{F}$ is called…
$\renewcommand{\Re}{\mathbb{R}}$Given a set $P$ of $n$ points in $\Re^d$, consider the problem of computing $k$ subsets of $P$ that form clusters that are well-separated from each other, and each of them is large (cardinality wise). We…