Related papers: Avoidable sets in groups
Let $X$ be a Banach space. We study the circumstances under which there exists an uncountable set $\mathcal A\subset X$ of unit vectors such that $\|x-y\|>1$ for distinct $x,y\in \mathcal A$. We prove that such a set exists if $X$ is…
A numerical semigroup is irreducible if it cannot be obtained as intersection of two numerical semigroups containing it properly. If we only consider numerical semigroups with the same Frobenius number, that concept is generalized to atomic…
For an interval [1,N] in the natural numbers, investigating subsets S of [1,N] such that |{(x,y) in S^2:x+y in S}|=0, known as sum-free sets, has attracted considerable attention. In this paper, we define r(S):=|{(x,y) in S^2: x+y in S}|…
A computable ring is a ring equipped with mechanical procedure to add and multiply elements. In most natural computable integral domains, there is a computational procedure to determine if a given element is prime/irreducible. However,…
We show that there is a set which is not a set of multiple recurrence despite being a set of recurrence for nil-Bohr sets. This answers Huang, Shao, and Ye's \enquote{higher-order} version of Katznelson's Question on Bohr recurrence and…
In many covering settings, it is natural to consider the presence both of elements that we seek to include and of elements that we seek to avoid. This paper introduces a novel combinatorial problem formalizing this tradeoff: from a…
A notion of arithmetic similarity between number fields is defined by requiring equality of some arithmetic statistics over all but finitely many rational primes. The exceptional set is empty in all previously studied cases, but existing…
There exists an infinite family of examples of subsets of $\mathbb{F}_q^2$ with $q^{4/3}$ elements whose distance sets are not the whole of $\mathbb{F}_q$.
Let K be a number field. A finite group G is called K-admissible if there exists a G-crossed product K-division algebra. K-admissibility has a necessary condition called K-preadmissibility that is known to be sufficient in many cases. It is…
The notion of (3+1)-avoidance has shown up in many places in enumerative combinatorics. The natural goal of enumeration of all (3+1)-avoiding posets remains open. In this paper, we enumerate graded (3+1)-avoiding posets for both reasonable…
We investigate prime avoidance for an arbitrary set of prime ideals in a commutative ring. Various necessary and/or sufficient conditions for prime avoidance are given, which yield natural classes of infinite sets of primes that satisfy…
We study the relative position of four subspaces in a Hilbert space. For any positive integer n, we give an example of exotic indecomposable system of four subspaces in a Hilbert space whose defect is (2n+1)/3. By an exotic system, we mean…
We determine the sets definable in expansions of the ordered real additive group by generalized Cantor sets. Given a natural number $r\geq 3$, we say a set $C$ is a generalized Cantor set in base $r$ if there is a non-empty…
We define the notion of $D$-set in an arbitrary semigroup, and with some mild restrictions we establish its dynamical and combinatorial characterizations. Assuming a weak form of cancellation in semigroups we have shown that the Cartesian…
A closed subgroup of a semisimple algebraic group is called irreducible if it lies in no proper parabolic subgroup. In this paper we classify all irreducible subgroups of exceptional algebraic groups $G$ which are connected, closed and…
Given a set A of non-negative integers and a set B of positive integers,we are interested in computing all sets C (of positive integers) that are minimal in the family of sets K (of positive integers) such that (i) K contains no elements…
The theory of optimal choice sets offers a well-established solution framework in social choice and game theory. In social choice theory, decision-making is typically modeled as a maximization problem. However, when preferences are cyclic…
The main objective of this paper is the following two results. (1) There exists a computable bi-orderable group that does not have a computable bi-ordering; (2) There exists a bi-orderable, two-generated recursively presented solvable group…
Let $G$ be a nontrivial transitive permutation group on a finite set $\Omega$ and recall that an element of $G$ is a derangement if it has no fixed points. Derangements always exist by a classical theorem of Jordan, but there are so-called…
Extending the notion of sunflowers, we call a family of at least two sets an odd-sunflower if every element of the underlying set is contained in an odd number of sets or in none of them. It follows from the Erd\H os--Szemer\'edi…