English
Related papers

Related papers: Spherical Designs and Generalized Sum-Free Sets in…

200 papers

We study the maximum size of a subset of the $n \times n$ integer grid that does not contain specific geometric configurations, a variation of the classical problems initiated by Erd\H{o}s and Purdy. While extremal problems for 3-point…

Combinatorics · Mathematics 2026-02-23 Máté Jánosik , Artúr Nádor , Zoltán Lóránt Nagy , László Bence Simon

We study anomalies of non-Abelian discrete symmetries; which part of non-Abelian group is anomaly free and which part can be anomalous. It is found that the anomaly-free elements of the group $G$ generate a normal subgroup $G_0$ of $G$ and…

High Energy Physics - Theory · Physics 2022-03-14 Tatsuo Kobayashi , Hikaru Uchida

We introduce partially defined dynamical systems defined on a topological space. To each such system we associate a functor $s$ from a category $G$ to $\Top^{\op}$ and show that it defines what we call a skew category algebra $A…

Rings and Algebras · Mathematics 2013-01-08 Patrik Lundström , Johan Öinert

$S \subseteq \mathbb{Z}_{2n}$ is said to be sum-free if $S$ has no solution to the equation $a+b=c$. The sum-free process on $\mathbb{Z}_{2n}$ starts with $S:=\emptyset$, and iteratively inserts elements of $\mathbb{Z}_{2n}$, where each…

Combinatorics · Mathematics 2019-12-03 Patrick Bennett

We try to embed a t-design in a finite commutative group in such a way that the sum of the k points of a block is zero. We can compute the number of blocks of the boolean 2-design having all the non zero vectors of $(Z_2)^n$ as the set of…

Combinatorics · Mathematics 2008-07-03 Andrea Caggegi , Alfonso Di Bartolo , Giovanni Falcone

We develop a new method leading the structure of finite subsets S and T of an abelian group with $|S+T|\le |S|+|T|$. We show also how to recover the known results in this area in a relatively short space.

Number Theory · Mathematics 2008-11-20 Yahya Ould Hamidoune

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

Given a linear equation $\mathcal{L}$, a set $A \subseteq [n]$ is $\mathcal{L}$-free if $A$ does not contain any `non-trivial' solutions to $\mathcal{L}$. We determine the precise size of the largest $\mathcal{L}$-free subset of $[n]$ for…

Combinatorics · Mathematics 2017-07-26 Robert Hancock , Andrew Treglown

Given an open set $T\subset [-1,1)$, we introduce the concepts of $T$-avoiding spherical codes and designs, that is, spherical codes that have no inner products in the set $T$. We show that certain codes found in the minimal vectors of the…

Combinatorics · Mathematics 2026-05-19 P. G. Boyvalenkov , D. D. Cherkashin , P. D. Dragnev

A Sidon set is a set of integers containing no nontrivial solutions to the equation $a+b=c+d$. We improve on the lower bound on the diameter of a Sidon set with $k$ elements: if $k$ is sufficiently large and ${\cal A}$ is a Sidon set with…

Number Theory · Mathematics 2024-11-12 Kevin O'Bryant

Let $\mathcal{S}$ be a finite cyclic semigroup written additively. An element $e$ of $\mathcal{S}$ is said to be idempotent if $e+e=e$. A sequence $T$ over $\mathcal{S}$ is called {\sl idempotent-sum free} provided that no idempotent of…

Combinatorics · Mathematics 2020-06-02 Guoqing Wang

A finite subset $X$ on the unit sphere $\mathbb{S}^{d-1}$ is called an $s$-distance set with strength $t$ if its angle set $A(X):=\{\langle \mathbf{x},\mathbf{y}\rangle : \mathbf{x},\mathbf{y}\in X,\mathbf{x}\neq\mathbf{y} \}$ has size $s$,…

Combinatorics · Mathematics 2020-07-31 Zhiqiang Xu , Zili Xu , Wei-Hsuan Yu

This paper is a continuation of the paper "Numerical Semigroups: Ap\'ery Sets and Hilbert Series". We consider the general numerical AA-semigroup, i.e., semigroups consisting of all non-negative integer linear combinations of relatively…

Commutative Algebra · Mathematics 2017-01-17 Ignacio García-Marco , Jorge L. Ramírez Alfonsín , Oystein J. Rodseth

In recent work, Miezaki introduced the notion of a $spherical$ $T$-d$esign$ in $\mathbb{R}^2$, where $T$ is a potentially infinite set. As an example, he offered the $\mathbb{Z}^2$-lattice points with fixed integer norm (a.k.a. shells).…

Number Theory · Mathematics 2021-12-23 Badri Vishal Pandey

This paper develops an explicit and implementable framework for constructing spherical designs by lifting point sets from tight fusion frames. By combining existing ingredients, we obtain, in every dimension, explicit spherical $5$-designs…

Combinatorics · Mathematics 2026-02-24 Ryutaro Misawa

For a sequence $S$ of terms from an abelian group $G$ of length $|S|$, let $\Sigma_n(S)$ denote the set of all elements that can be represented as the sum of terms in some $n$-term subsequence of $S$. When the subsum set is very small,…

Number Theory · Mathematics 2019-10-28 David J. Grynkiewicz

Let A,B,S be finite subsets of an abelian group G. Suppose that the restricted sumset C={a+b: a in A, b in B, and a-b not in S} is nonempty and some c in C can be written as a+b with a in A and b in B in at most m ways. We show that if G is…

Combinatorics · Mathematics 2007-05-23 Hao Pan , Zhi-Wei Sun

Let (G, +) be an abelian group. A subset of G is sumfree if it contains no elements x, y, z such that x +y = z. We extend this concept by introducing the Schur degree of a subset of G, where Schur degree 1 corresponds to sumfree. The…

Combinatorics · Mathematics 2021-08-19 Shalom Eliahou , Pastora Revuelta

In this paper, we consider a natural generalization of the concept of order of an element in a group: an element $g \in G$ is said to have order $k$ in a subgroup $H$ of $G$ (\resp \wrt a coset $Hu$) if $k$ is the first strictly positive…

Group Theory · Mathematics 2021-05-11 Jordi Delgado , Enric Ventura , Alexander Zakharov

Let G=SL_3(Z/pZ), p a prime. Let A be a set of generators of G. Then A grows under the group operation. To be precise: denote by |S| the number of elements of a finite set S. Assume |A| < |G|^{1-\epsilon} for some \epsilon>0. Then |A\cdot…

Group Theory · Mathematics 2009-06-08 H. A. Helfgott