English
Related papers

Related papers: Algebraic capsets

200 papers

A given subset $A$ of natural numbers is said to be complete if every element of $\N$ is the sum of distinct terms taken from $A$. This topic is strongly connected to the knapsack problem which is known to be NP complete. The main goal of…

Combinatorics · Mathematics 2024-06-07 Norbert Hegyvári , Máté Pálfy , Erfei Yue

Given a subset $W$ of an abelian group $G$, a subset $C$ is called an additive complement for $W$ if $W+C=G$; if, moreover, no proper subset of $C$ has this property, then we say that $C$ is a minimal complement for $W$. It is natural to…

Combinatorics · Mathematics 2021-01-01 Noga Alon , Noah Kravitz , Matt Larson

A subset $M \subset \textbf{R}^3$ is called a \emph{basic subset}, if for any funciton $f \colon M \to \textbf{R}$ there exist such functions $f_1; f_2; f_3 \colon \textbf{R} \to \textbf{R}$ that $f(x_1, x_2, x_3) = f_1(x_1) + f_2(x_2) +…

Combinatorics · Mathematics 2014-12-30 Ivan Reshetnikov

We determine all finite subgroups of simple algebraic groups that have irreducible centralizers - that is, centralizers whose connected component does not lie in a parabolic subgroup.

Group Theory · Mathematics 2016-06-10 Martin W. Liebeck , Adam R. Thomas

We prove new lower bounds on the maximum size of sets $A\subseteq \mathbb{F}_p^n$ or $A\subseteq \mathbb{Z}_m^n$ not containing three-term arithmetic progressions (consisting of three distinct points). More specifically, we prove that for…

Combinatorics · Mathematics 2024-01-24 Christian Elsholtz , Laura Proske , Lisa Sauermann

We provide an improvement over Meshulam's bound on cap sets in $F_3^N$. We show that there exist universal $\epsilon>0$ and $C>0$ so that any cap set in $F_3^N$ has size at most $C {3^N \over N^{1+\epsilon}}$. We do this by obtaining quite…

Classical Analysis and ODEs · Mathematics 2011-04-05 Michael Bateman , Nets Hawk Katz

An $n$-cap in $k$-dimensional projective space is a set of $n$ points so that no three lie on a line. In this note, we provide an algorithm to count the number of $n$-caps in $\mathbb{P}^3(\mathbb{F}_q)$, which follows from our recent paper…

Combinatorics · Mathematics 2022-06-23 Kelly Isham

Cylindrical Algebraic Decomposition (CAD) algorithms typically produce a decomposition adapted to a finite family of semi-algebraic sets $\mathcal{F}$ (i.e. every member of $\mathcal{F}$ is a union of cells). Different algorithms may…

Symbolic Computation · Computer Science 2026-05-07 Lucas Michel

The study of Frobenius endomorphism provides numerous information about its corresponding Abelian variety. To understand the action of the Frobenius endomorphism, one may be interested in its eigenvalues. According to Weil's third…

First, we study constructible subsets of $\A^n_k$ which contain a line in any direction. We classify the smallest such subsets in $\A^3$ of the type $R\cup\{g\neq 0\},$ where $g\in k[x_1,...,x_n]$ is irreducible of degree $d$, and $R\subset…

Algebraic Geometry · Mathematics 2014-10-17 Kaloyan Slavov

We construct a topology on a given algebraically closed field with a distinguished subfield which is also algebraically closed. This topology is finer than Zariski topology and it captures the sets definable in the pair of algebraically…

Logic · Mathematics 2017-06-08 Ayhan Günaydın

Working over the field of order 2 we consider those complete caps (maximal sets of points with no three collinear) which are disjoint from some codimension 2 subspace of projective space. We derive restrictive conditions which such a cap…

Combinatorics · Mathematics 2007-05-23 David L. Wehlau

We determine upper bounds on the number of rational points of an affine or projective algebraic set defined over an extension of a finite field by a system of polynomial equations, including the case where the algebraic set is not defined…

Algebraic Geometry · Mathematics 2014-07-28 Gilles Lachaud , Robert Rolland

We prove new lower bounds on the maximum size of subsets $A\subseteq \{1,\dots,N\}$ or $A\subseteq \mathbb{F}_p^n$ not containing three-term arithmetic progressions. In the setting of $\{1,\dots,N\}$, this is the first improvement upon a…

Number Theory · Mathematics 2024-06-19 Christian Elsholtz , Zach Hunter , Laura Proske , Lisa Sauermann

The least upper bound on degrees of elements of a minimal system of generators of the algebra of invariants of 3x3 matrices is found, and the nilpotency degree of a relatively free finitely generated algebra with the identity x^3=0 is…

Rings and Algebras · Mathematics 2007-05-23 A. A. Lopatin

Given a set of points in the plane, the \textsc{General Position Subset Selection} problem is that of finding a maximum-size subset of points in general position, i.e., with no three points collinear. The problem is known to be ${\rm…

Computational Geometry · Computer Science 2025-04-01 Adrian Dumitrescu

In this paper we extend some set theoretic concepts of numerical semigroups for arbitrary sub-semigroups of natural numbers. Then we characterized gapsets which leads to a more efficient computational approach towards numerical semigroups…

Combinatorics · Mathematics 2024-08-06 Arman Ataei Kachouei , Farhad Rahmati

An amoeba is the image of a subvariety of an algebraic torus under the logarithmic moment map. We consider some qualitative aspects of amoebas, establishing some results and posing problems for further study. These problems include…

Algebraic Geometry · Mathematics 2022-06-22 Mounir Nisse , Frank Sottile

We consider the algebraization problem for principal bundles with reductive structure group, defined on the complement of a closed subset Z in a proper formal scheme. We show that, when Z is of codimension at least 3, an algebraization…

Algebraic Geometry · Mathematics 2008-03-07 Vladimir Baranovsky

F. Wehrung has asked: Given a family $\mathcal{C}$ of subsets of a set $\Omega$, under what conditions will there exist a total ordering on $\Omega$ under which every member of $\mathcal{C}$ is convex? <p> Note that if $A$ and $B$ are…

Combinatorics · Mathematics 2020-11-17 George M. Bergman