English
Related papers

Related papers: Avoidable sets in groups

200 papers

A subset $U$ of a set $S$ with a binary operation is called {\it avoidable} if $S$ can be partitioned into two subsets $A$ and $B$ such that no element of $U$ can be written as a product of two distinct elements of $A$ or as the product of…

Combinatorics · Mathematics 2007-06-26 Nandor Sieben

A set X of partial words over a finite alphabet A is called unavoidable if every two-sided infinite word over A has a factor compatible with an element of X. Unlike the case of a set of words without holes, the problem of deciding whether…

Formal Languages and Automata Theory · Computer Science 2017-08-23 Joey Becker , F. Blanchet-Sadri , Laure Flapan , Stephen Watkins

A partition of the positive integers into sets $A$ and $B$ {\em avoids} a set $S\subset\N$ if no two distinct elements in the same part have a sum in $S$. If the partition is unique, $S$ is {\em uniquely avoidable.} For any irrational…

Combinatorics · Mathematics 2016-09-07 David J. Grabiner

The set of all avoidable patterns in n or fewer letters can be avoided on an alphabet with 2(n+2) letters.

Combinatorics · Mathematics 2018-01-29 Irina Melnichuk

The Union Closed Sets Conjecture states that in every finite, nontrivial set family closed under taking unions there is an element contained in at least half of all the sets of the family. We investigate two new directions with respect to…

Combinatorics · Mathematics 2023-04-05 Nicolas Nagel

We consider partially ordered sets of combinatorial structures under consecutive orders, meaning that two structures are related when one embeds in the other such that `consecutive' elements remain consecutive in the image. Given such a…

Combinatorics · Mathematics 2026-04-22 Victoria Ironmonger , Nik Ruškuc

In this paper, we focus on families of bipartitions, i.e. set partitions consisting of at most two components. We say that a family of bipartitions is a separating family for a set $S$ if every two elements in $S$ can be separated by some…

Combinatorics · Mathematics 2011-11-08 Takahisa Toda , Ivo Vigan

We define a notion of an arithmetic set in an arbitrary countable group and study properties of these sets in the cases of Abelian groups and non-abelian free groups.

Group Theory · Mathematics 2014-12-02 Azer Akhmedov , Damiano Fulghesu

Given two families of sets $\mathcal{F}$ and $\mathcal{G}$, the $\mathcal{F}$ separability problem for $\mathcal{G}$ asks whether for two given sets $U, V \in \mathcal{G}$ there exists a set $S \in \mathcal{F}$, such that $U$ is included in…

Formal Languages and Automata Theory · Computer Science 2016-09-02 Lorenzo Clemente , Wojciech Czerwiński , Sławomir Lasota , Charles Paperman

A set $A$ is said to split a finite set $B$ if exactly half the elements of $B$ (up to rounding) are contained in $A$. We study the dual notions: (1) splitting family, which is a collection of sets such that any subset of $\{1,\ldots,k\}$…

Combinatorics · Mathematics 2022-03-15 Samuel Coskey , Bryce Frederickson , Samuel Mathers , Hao-Tong Yan

Consider the sets of integers $A$ that avoid any arrangement of $g$ congruent $h$-subsets. Our findings refine and improve upon some results by Erd\H{o}s and Harzheim about these sets.

Number Theory · Mathematics 2013-06-28 Rafael Tesoro

Diestel, et al. (see Order 35 (2017), JCT-A 167 (2019), arXiv:1805.01439) introduced the notion of abstract separation systems that satisfy a submodularity property, and they call this structural submodularity. Williamson, Goemans, Mihail,…

Discrete Mathematics · Computer Science 2026-01-05 Miles Simmons , Ishan Bansal , Joe Cheriyan

A $1$-avoiding set is a subset of $\mathbb{R}^n$ that does not contain pairs of points at distance $1$. Let $m_1(\mathbb{R}^n)$ denote the maximum fraction of $\mathbb{R}^n$ that can be covered by a measurable $1$-avoiding set. We prove two…

Metric Geometry · Mathematics 2018-03-12 Tamás Keleti , Máté Matolcsi , Fernando Mário de Oliveira Filho , Imre Z. Ruzsa

We give an asymptotic estimate for the number of partitions of a set of $n$ elements, whose block sizes avoid a given set $\mathcal{S}$ of natural numbers. As an application, we derive an estimate for the number of partitions of a set with…

Combinatorics · Mathematics 2018-06-07 Joshua Culver , Andreas Weingartner

Families of unconditionally $\tau$-closed and $\tau$-algebraic sets in a group are defined, which are natural generalizations of unconditionally closed and algebraic sets defined by Markov. A sufficient condition for the coincidence of…

Group Theory · Mathematics 2007-06-14 Ol'ga V. Sipacheva

The set splittability problem is the following: given a finite collection of finite sets, does there exits a single set that contains exactly half the elements from each set in the collection? (If a set has odd size, we allow the floor or…

Combinatorics · Mathematics 2019-09-17 Peter Bernstein , Cashous Bortner , Samuel Coskey , Shuni Li , Connor Simpson

In comparing well-known CRDTs representing sets that can grow and shrink, we find caveats. In one, the removal of an element cannot be reliably undone. In another, undesirable states are attainable, such as when an element is present -1…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-06-19 Stephen Dolan

In the additive topological group $(\mathbb{R},+)$ of real numbers, we construct families of sets for which elements are not measurable in the Lebesgue sense. The constructed families have algebraic structures of being semigroups (i.e.,…

Functional Analysis · Mathematics 2024-08-13 Venuste Nyagahakwa , Gratien Haguma , Joseline Munyaneza

Usual math sets have special types: countable, compact, open, occasionally Borel, rarely projective, etc. Each such set is described by a single Set Theory formula with parameters unrelated to other formulas. Exotic expressions involving…

Logic in Computer Science · Computer Science 2026-04-01 Leonid A. Levin

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…

Logic · Mathematics 2025-04-16 Alfred Dolich , John Goodrick
‹ Prev 1 2 3 10 Next ›