English
Related papers

Related papers: Small Sets with Large Difference Sets

200 papers

A set of $N$ permutations of $\{1,2,\ldots,v\}$ is $t$-suitable, if each symbol precedes each subset of $t-1$ others in at least one permutation. The extremal problem of determining the smallest size $N$ of such sets for given $v$ and $t$…

Combinatorics · Mathematics 2018-08-10 Xiande Zhang

Singular nonsymmetric Macdonald polynomials are constructed by use of the representation theory of the Hecke algebras of the symmetric groups. These polynomials are labeled by quasistaircase partitions and are associated to special…

Representation Theory · Mathematics 2020-02-28 Laura Colmenarejo , Charles F. Dunkl

Let $s_1,s_2,\ldots s_n$ be states of a general probability theory, and $\mathcal A$ be the set of all subsets of indices $H \subset [n]\equiv\{1,2,\ldots n\}$ such that the states $(s_j)_{j\in H}$ are jointly perfectly distinguishable. All…

Quantum Physics · Physics 2023-01-18 Mihály Weiner

We study the hit problem, set up by F. Peterson, of finding a minimal set of generators for the polynomial algebra $P_k := \mathbb F_2[x_1,x_2,...,x_k]$ as a module over the mod-2 Steenrod algebra, $\mathcal{A}$. In this paper, we study a…

Algebraic Topology · Mathematics 2016-06-22 Nguyen Sum

We consider the set $A_{n}=\displaystyle\cup_{j=0}^{\infty}\{\varepsilon_{j}(n)\cdot n^j\colon\varepsilon_{j}(n)\in\{0,\pm1,\pm2,...,\pm\lfloor{{n}/{2}}\rfloor\}\} $. Let $\mathcal{S}_{\mathcal{A}}= \bigcup_{a \in\mathcal{A} } A_{a}$ where…

Number Theory · Mathematics 2019-02-26 Satyanand Singh

Coreset (or core-set) is a small weighted \emph{subset} $Q$ of an input set $P$ with respect to a given \emph{monotonic} function $f:\mathbb{R}\to\mathbb{R}$ that \emph{provably} approximates its fitting loss $\sum_{p\in P}f(p\cdot x)$ to…

Machine Learning · Computer Science 2021-12-24 Elad Tolochinsky , Ibrahim Jubran , Dan Feldman

In this note we find the optimal lower bound for the size of the sumsets $HA$ and $H\,\hat{}A$ over finite sets $H, A$ of nonnegative integers, where $HA = \bigcup_{h\in H} hA$ and $H\,\hat{}A = \bigcup_{h\in H} h\,\hat{}A$. We also find…

Combinatorics · Mathematics 2021-06-09 Jagannath Bhanja

We say that a 0-1 matrix $N$ of size $a\times b$ can be found in a collection of sets $\mathcal{H}$ if we can find sets $H_{1}, H_{2}, \dots, H_{a}$ in $\mathcal{H}$ and elements $e_1, e_2, \dots, e_b$ in $\cup_{H \in \mathcal{H}} H$ such…

Combinatorics · Mathematics 2013-08-28 Sylvain Gravier , Frédéric Maffray , Jérôme Renault , Nicolas Trotignon

Given an initial family of sets, we may take unions, intersections and complements of the sets contained in this family in order to form a new collection of sets; our construction process is done recursively until we obtain the last family.…

Combinatorics · Mathematics 2024-09-11 Jorge Garcia , Rosemarie Bongers , Jonathan Detgen , Walter Morales

Let $p$ be a prime, let $S$ be a non-empty subset of $\mathbb{F}_p$ and let $0<\epsilon\leq 1$. We show that there exists a constant $C=C(p, \epsilon)$ such that for every positive integer $k$, whenever $\phi_1, \dots, \phi_k:…

Combinatorics · Mathematics 2023-06-02 W. T. Gowers , Thomas Karam

We call a subset $A$ of the (additive) abelian group $G$ {\it $t$-independent} if for all non-negative integers $h$ and $k$ with $h+k \leq t$, the sum of $h$ (not necessarily distinct) elements of $A$ does not equal the sum of $k$ (not…

Number Theory · Mathematics 2015-12-10 Béla Bajnok , Imre Ruzsa

For a fixed positive integer $d$ and a small real $p>0$, sample a $p$-random subset $A \subseteq \mathbb{Z}_{\geq 0}^d$, and let $S:=\langle A \rangle$ be the generalized numerical semigroup generated by $A$. We show that with high…

Combinatorics · Mathematics 2026-04-29 Veronica Bitonti , Noah Kravitz

In this paper we study the following set\[A=\{p(n)+2^nd \mod 1: n\geq 1\}\subset [0.1],\] where $p$ is a polynomial with at least one irrational coefficient on non constant terms, $d$ is any real number and for $a\in [0,\infty)$, $a \mod 1$…

Number Theory · Mathematics 2020-12-23 Han Yu

The partition problem is a well-known basic NP-complete problem. We mainly consider the optimization version of it in this paper. The problem has been investigated from various perspectives for a long time and can be solved efficiently in…

Discrete Mathematics · Computer Science 2024-05-10 Susumu Kubo

Let $G$ be a locally compact abelian group with Haar measure $\mu$. For integers $n \geq 2$ and $H \geq 2$ and for any $n$-tuples $\mathbf{u}_1,\ldots, \mathbf{u}_H \in \mathbf{N}^n$, there exist measurable subsets $A_1,\ldots, A_n$ of $G$…

Number Theory · Mathematics 2026-01-19 Melvyn B. Nathanson

We prove that every set $A\subset\mathbb{Z}/p\mathbb{Z}$ with $\mathbb{E}_x\min(1_A*1_A(x),t)\le(2+\delta)t\mathbb{E}_x 1_A(a)$ is very close to an arithmetic progression. Here $p$ stands for a large prime and $\delta,t$ are small real…

Combinatorics · Mathematics 2015-06-02 Przemysław Mazur

We address the problem of building an index for a set $D$ of $n$ strings, where each string location is a subset of some finite integer alphabet of size $\sigma$, so that we can answer efficiently if a given simple query string (where each…

Formal Languages and Automata Theory · Computer Science 2010-10-04 Kimmo Fredriksson

The present paper is motivated by the need to generalize the construction of the Scarf complex in order to give combinatorial resolutions of a much broader class of modules than just the monomial ideals. For any subset $A\subseteq…

Combinatorics · Mathematics 2015-11-30 James J. Madden , Trevor McGuire

We show that a topologically generating set $S$ of a connected compact Lie group $G$ of size larger than a fixed polynomial in the rank of $G$ must be redundant (i.e., some proper subset of $S$ still topologically generates $G$). Similar…

Group Theory · Mathematics 2026-04-24 Tal Cohen , Itamar Vigdorovich

We study explicit constructions of min-wise hash families and their extension to $k$-min-wise hash families. Informally, a min-wise hash family guarantees that for any fixed subset $X\subseteq[N]$, every element in $X$ has an equal chance…

Data Structures and Algorithms · Computer Science 2025-11-11 Xue Chen , Shengtang Huang , Xin Li
‹ Prev 1 4 5 6 7 8 10 Next ›