English
Related papers

Related papers: Algebraic capsets

200 papers

There has been much work on the following question: given n how large can a subset of {1,...,n} be that has no arithmetic progressions of length 3. We call such sets 3-free. Most of the work has been asymptotic. In this paper we sketch…

Combinatorics · Mathematics 2025-01-06 William Gasarch , James Glenn , Clyde Kruskal

We classify the category of finite-dimensional real division composition algebras having a non-abelian Lie algebra of derivations. Our complete and explicit classification is largely achieved by introducing the concept of a…

Rings and Algebras · Mathematics 2015-09-18 Seidon Alsaody

The aim of this paper is to present the main constructions of the substructures of an almost groupoid and to discuss their basic properties. The definitions and properties concerning these new algebraic constructions extend to almost…

Group Theory · Mathematics 2026-02-06 Mihai Ivan

We address the problem of the maximal finite number of real points of a real algebraic curve (of a given degree and, sometimes, genus) in the projective plane. We improve the known upper and lower bounds and construct close to optimal…

Algebraic Geometry · Mathematics 2019-09-13 Erwan Brugallé , Alex Degtyarev , Ilia Itenberg , Frédéric Mangolte

A forcing set for a perfect matching of a graph is defined as a subset of the edges of that perfect matching such that there exists a unique perfect matching containing it. A complete forcing set for a graph is a subset of its edges, such…

Combinatorics · Mathematics 2024-09-27 Javad B. Ebrahimi , Aref Nemayande , Elahe Tohidi

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…

General Mathematics · Mathematics 2009-10-25 Wieslaw A. Dudek , Valentin S. Trokhimenko

A subset of $\mathbb{F}_q^2$ is called an arc if it does not contain three collinear points. We show that there are at most $\binom{(1 + o(1))q}{m}$ arcs of size $m \gg q^{1/2} (\log q)^{3/2}$, nearly matching a trivial lower bound…

Combinatorics · Mathematics 2024-10-30 Rajko Nenadov

Some new families of small complete caps in $PG(N,q)$, $q$ even, are described. By using inductive arguments, the problem of the construction of small complete caps in projective spaces of arbitrary dimensions is reduced to the same problem…

Combinatorics · Mathematics 2009-01-06 Alexander A. Davydov , Massimo Giulietti , Stefano Marcugini , Fernanda Pambianco

A subset of a group is product-free if it does not contain elements a, b, c such that ab = c. We review progress on the problem of determining the size of the largest product-free subset of an arbitrary finite group, including a lower bound…

Group Theory · Mathematics 2007-11-08 Kiran S. Kedlaya

Finite versions of W-algebras are introduced by considering (symplectic) reductions of finite dimensional simple Lie algebras. In particular a finite analogue of $W^{(2)}_3$ is introduced and studied in detail. Its unitary and non-unitary,…

High Energy Physics - Theory · Physics 2009-10-22 T. Tjin

We consider several ways of decomposing models into parts of bounded size forming a congruence over a base, and show that admitting any such decomposition is equivalent to mutual algebraicity at the level of theories. We also show that a…

Logic · Mathematics 2022-08-11 Samuel Braunfeld , Michael C Laskowski

The notion of a complete Boolean algebra, although completely legitimate in constructive mathematics, fails to capture some natural structures such as the lattice of subsets of a given set. Sambin's notion of an overlap algebra, although…

Logic in Computer Science · Computer Science 2023-06-22 Francesco Ciraulo , Michele Contente

Let $f(n,\ell)$ be the maximum integer such that every set of $n$ points in the plane with at most $\ell$ collinear contains a subset of $f(n,\ell)$ points with no three collinear. First we prove that if $\ell \leq O(\sqrt{n})$ then…

Combinatorics · Mathematics 2016-02-09 Michael S. Payne , David R. Wood

We prove that any finite abelian group $G$ contains a collection of not too many subsets with a special structure, so that for every subset $A$ of $G$ with a small doubling, there is a member $F$ of the collection that is fully contained in…

Combinatorics · Mathematics 2025-09-03 Noga Alon , Huy Tuan Pham

Topological drawings are representations of graphs in the plane, where vertices are represented by points, and edges by simple curves connecting the points. A drawing is simple if two edges intersect at most in a single point, either at a…

Computational Geometry · Computer Science 2022-09-08 Alfredo García , Alexander Pilz , Javier Tejel

We develop a new approach to address some classical questions concerning the size and structure of integer distance sets. Our main result is that any integer distance set in the Euclidean plane is either very sparse or has all but an…

Number Theory · Mathematics 2025-08-26 Rachel Greenfeld , Marina Iliopoulou , Sarah Peluse

We study classes of Borel subsets of the real line $\mathbb{R}$ such as levels of the Borel hierarchy and the class of sets that are reducible to the set $\mathbb{Q}$ of rationals, endowed with the Wadge quasi-order of reducibility with…

Logic · Mathematics 2021-03-11 Daisuke Ikegami , Philipp Schlicht , Hisao Tanaka

We define nodal finite dimensional algebras and describe their structure over an algebraically closed field. For a special class of such algebras (type A) we find a criterion of tameness.

Representation Theory · Mathematics 2015-01-27 Yuriy A. Drozd , Vasyl V. Zembyk

For any group G of order n, a subset A of G is said to be product-free if there is no solution of the equation ab=c with a,b,c in A. Previous results of Gowers showed that the size of any product-free subset of G is at most n/d^(1/3), where…

Group Theory · Mathematics 2008-04-07 Kiran S. Kedlaya , Xuancheng Shao

For a degree sequence, we define the set of edges that appear in every labeled realization of that sequence as forced, while the edges that appear in none as forbidden. We examine structure of graphs whose degree sequences contain either…

Combinatorics · Mathematics 2019-11-28 Brian Cloteaux
‹ Prev 1 3 4 5 6 7 10 Next ›