Related papers: Gapsets of small multiplicity

We describe an infinite family of graphs $G_n$, where $G_n$ has $n$ vertices, independence number at least $n/4$, and no set of less than $\sqrt{n}/2$ vertices intersects all its maximum independent sets. This is motivated by a question of…

A \emph{self-complementary} graph is a graph isomorphic to its complement. An isomorphism between $G$ and its complement, viewed as a permutation of $V(G)$, is then called an \emph{antimorphism}. A \emph{skew partition} of $G$ is a…

We prove that g (the groupwise density number) is smaller or equal to b^+ (the successor of the minimal cardinality of a non-dominated subset of omega^omega).

A numerical semigroup is a subset of the non-negative integers that is closed under addition. For a randomly generated numerical semigroup, the expected number of minimum generators can be expressed in terms of a doubly-indexed sequence of…

We prove that hypergraphs defined by low-degree polynomial inequalities contain large homogeneous subsets. Formally, let $H$ be an $r$-uniform hypergraph on $N$ vertices that is semialgebraic of constant description complexity, and each…

Given an integer $g$ and also some given integers $m$ (sufficiently large) and $c_1,\dots, c_m$, we show that the number of all non-negative integers $n\le M$ with the property that there exist non-negative integers $k_1,\dots, k_m$ such…

A functional Menger $\cap$-algebra is a set of n-place functions containing n projections and closed under the so-called Menger's compositions of n-place functions and the set-theoretic intersection of functions. We give the abstract…

We prove that, for each fixed genus, the portion of semigroups of that genus belonging to infinite chains in the semigroup tree approaches 0 as the genus grows to infinite. This means that most numerical semigroups have a finite number of…

We obtain upper bounds for the multiplicity of an isolated solution of a system of equations $f_1=...= f_M =0$ in $M$ variables, where the set of polynomials $(f_1,..., f_M)$ is a tuple of general position in a subvariety of a given…

Let G be a finite abelian group. For g in G and i an integer we define N(i,g) to be the number of subsets of G of size i which sum up to g. We will give a short proof, using character theory, of a formula for these N(i,g) due to Li and Wan.…

We say that a subset $S$ of an infinite group $G$ is a Ramsey-product subset if, for any infinite subsets $X$, $Y$ of $G$, there exist $x \in X$ and $y\in Y$ such that $x y \in S$ and $ y x \in S$ . We show that the family $\varphi$ of all…

In this note, we give the explicit formula for the number of multisubsets of a finite abelian group $G$ with any given size such that the sum is equal to a given element $g\in G$. This also gives the number of partitions of $g$ into a given…

Let $W,W'\subseteq G$ be nonempty subsets in an arbitrary group $G$. The set $W'$ is said to be a complement to $W$ if $WW'=G$ and it is minimal if no proper subset of $W'$ is a complement to $W$. We show that, if $W$ is finite then every…

The residual finiteness growth $\text{RF}_G: \mathbb{N} \to \mathbb{N}$ of a finitely generated group $G$ is a function that gives the smallest value of the index $[G:N]$ with $N$ a normal subgroup not containing a non-trivial element $g$,…

We give very precise bounds for the congruence subgroup growth of arithmetic groups. This allows us to determine the subgroup growth of irreducible lattices of semisimple Lie groups. In the most general case our results depend on the…

Let $G$ be a group. A subset $D$ of $G$ is a determining set of $G$, if every automorphism of $G$ is uniquely determined by its action on $D$. The determining number of $G$, denoted by $\alpha(G)$, is the cardinality of a smallest…

In this paper, we study the pure $\kappa-$sparse gapsets and our focus on getting information about the sequence observed in Table 3 at [1], this sequence is listed in OEIS as A374773. We verify that the cardinality of the set of gapsets…

A bisection of a graph is a bipartition of its vertex set such that the two resulting parts differ in size by at most 1, and its size is the number of edges that connect vertices in the two parts. The perfect matching condition and…

A graph $G$ is said to be Ramsey size-linear if $r(G,H) =O_G (e(H))$ for every graph $H$ with no isolated vertices. Erd\H{o}s, Faudree, Rousseau, and Schelp observed that $K_4$ is not Ramsey size-linear, but each of its proper subgraphs is,…

Let $d(G)$ be the smallest cardinality of a generating set of a finite group $G.$ We give a complete classification of the finite groups with the property that, whenever $ \langle x_1, \dots, x_{d(G)} \rangle = \langle y_1, \dots, y_{d(G)}…