Related papers: Abelian groups yield many large families for the d…
Given a finite poset P, we consider the largest size La(n,P) of a family of subsets of $[n]:=\{1,...,n\}$ that contains no subposet P. This problem has been studied intensively in recent years, and it is conjectured that $\pi(P):=…
Let $La(n,P)$ be the maximum size of a family of subsets of $[n]=\{1,2,...,n\}$ not containing $P$ as a (weak) subposet. The diamond poset, denoted $B_{2}$, is defined on four elements $x,y,z,w$ with the relations $x<y,z$ and $y,z<w$.…
Given a finite poset $P$, we consider the largest size $\lanp$ of a family $\F$ of subsets of $[n]:=\{1,...,n\}$ that contains no subposet $P$. This continues the study of the asymptotic growth of $\lanp$; it has been conjectured that for…
The main goal of the current paper is to determine the total number of diamonds in the subgroup lattice of a finite abelian group. This counting problem is reduced to finite $p$-groups. Explicit formulas are obtained in some particular…
We introduce and study diamonds of GL(2,R)-invariant subvarieties of Abelian and quadratic differentials, which allow us to recover information on an invariant subvariety by simultaneously considering two degenerations, and which provide a…
The complexity of the equation solvability problem is known for nilpotent groups, for not solvable groups and for some semidirect products of Abelian groups. We provide a new polynomial time algorithm for deciding the equation solvability…
A result of Pyber states that every finite group $G$ contains an abelian subgroup whose order is quasi-polynomially large in $\lvert G\rvert$. We prove a similar result for $K$-approximate subgroups of solvable groups under only modest…
In the theory of partially-ordered sets, the two-dimensional Boolean lattice is known as the diamond. In this paper, we show that, if $\mathcal{F}$ is a family in the $n$-dimensional Boolean lattice that has no diamond as a subposet, then…
We study the structure of infinite discrete sets D definable in expansions of ordered Abelian groups whose theories are strong and definably complete, with particular emphasis on the set D' comprised of differences between successive…
In this article, we first describe all nonempty sets of integers S with the property that for all n and m in S, not necessarily distinct, the set {n-m,n+m} intersected with S consists of a single element. These are the sets with at most two…
Symmetries occur naturally in CSP or SAT problems and are not very difficult to discover, but using them to prune the search space tends to be very challenging. Indeed, this usually requires finding specific elements in a group of…
In this paper we begin the systematic study of group equations with abelian predicates in the main classes of groups where solving equations is possible. We extend the line of work on word equations with length constraints, and more…
For a family of subsets of $[n]:={1,2,...,n}$, the Lubell function is defined as $\hb_n(\F):=\sum_{F\in\F}\binom{n}{|F|}^{-1}$. In \cite{GriLiLu}, Griggs, Lu, and the author conjectured that if a family $\F$ of subset of $[n]$ does not…
For a given fixed poset $\mathcal P$ we say that a family of subsets of $[n]$ is $\mathcal P$-saturated if it does not contain an induced copy of $\mathcal P$, but whenever we add to it a new set, an induced copy of $\mathcal P$ is formed.…
We show that after mapping each element of a set of second class constraints to the surface of the other ones, half of them form a subset of abelian first class constraints. The explicit form of the map is obtained considering the most…
Resolving a conjecture of Methuku and the first author we determine the size of the largest family of subsets of an $n$-element set avoiding both $Y_k$ and $Y_k'$ as induced subposets. The result follows as a consequence of the analogous…
The defining characteristic of an exceptional point (EP) in the parameter space of a family of operators is that upon encircling the EP eigenstates are permuted. In case one encircles multiple EPs, the question arises how to properly…
A strong clique in a graph is a clique intersecting all inclusion-maximal stable sets. Strong cliques play an important role in the study of perfect graphs. We study strong cliques in the class of diamond-free graphs, from both structural…
The second author has recently shown ([20]) that any selectively (a) almost disjoint family must have cardinality strictly less than $2^{\alpeh_0}$, so under the Continuum Hypothesis such a family is necessarily countable. However, it is…
In 2007, B. Poonen (unpublished) studied the $p$--adic closure of a subgroup of rational points on a commutative algebraic group. More recently, J. Bella\"iche asked the same question for the special case of Abelian varieties. These…