English
Related papers

Related papers: Algebraic capsets

200 papers

The method of brackets is an efficient method for the evaluation of a large class of definite integrals on the half-line. It is based on a small collection of rules, some of which are heuristic. The extension discussed here is based on the…

Classical Analysis and ODEs · Mathematics 2017-07-28 Ivan Gonzalez , Karen Kohl , Lin Jiu , Victor H. Moll

We say that a set is a multiplicative 3-Sidon set if the equation $s_1s_2s_3=t_1t_2t_3$ does not have a solution consisting of distinct elements taken from this set. In this paper we show that the size of a multiplicative 3-Sidon subset of…

Number Theory · Mathematics 2018-01-29 Péter Pál Pach

The \emph{index set} of a computable structure $\mathcal{A}$ is the set of indices for computable copies of $\mathcal{A}$. We determine the complexity of the index sets of various mathematically interesting structures, including arbitrary…

Logic · Mathematics 2008-03-25 Wesley Calvert , Valentina S. Harizanov , Julia F. Knight , Sara Miller

Let Y be a surface with only finitely many singularities all of which are cusps. A set of cusps on Y is called three-divisible, if there is a cyclic global triple cover of Y branched precisely over these cusps. The aim of this note is to…

Algebraic Geometry · Mathematics 2012-09-25 Wolf P. Barth , Slawomir Rams

A corner is a set of three points in $\mathbf{Z}^2$ of the form $(x, y), (x + d, y), (x, y + d)$ with $d \neq 0$. We show that for infinitely many $N$ there is a set $A \subset [N]^2$ of size $2^{-(c + o(1)) \sqrt{\log_2 N}} N^2$ not…

Combinatorics · Mathematics 2021-03-11 Ben Green

A semi-algebraic set is a subset of the real space defined by polynomial equations and inequalities having real coefficients and is a union of finitely many maximally connected components. We consider the problem of deciding whether two…

Algebraic Geometry · Mathematics 2020-11-16 Hoon Hong , James Rohal , Mohab Safey El Din , Eric Schost

A 3-simplex is a collection of four sets A_1,...,A_4 with empty intersection such that any three of them have nonempty intersection. We show that the maximum size of a set system on n elements without a 3-simplex is $2^{n-1} +…

Combinatorics · Mathematics 2010-10-26 Michael E. Picollelli

We develop a noncompact version of the Hopf maps based on the split algebras. The split algebras consist of three species: split-complex numbers, split quaternions, and split octonions. They correspond to three noncompact Hopf maps that…

Mathematical Physics · Physics 2014-11-18 Kazuki Hasebe

An s-cap n-flat, or an n-dimensional cap of size s, is a pair (S,F) where F is an n-dimensional affine space over Z/3Z and the size-s subset S of F contains no triple of collinear points. The cap set problem in dimension n asks for the…

Combinatorics · Mathematics 2022-06-22 Henry Robert Thackeray

Quantitative estimates related to the classical Borsuk problem of splitting set in Euclidean space into subsets of smaller diameter are considered. For a given $k$ there is a minimal diameter of subsets at which there exists a covering with…

Metric Geometry · Mathematics 2022-10-25 Alexander Tolmachev , Dmitry Protasov , Vsevolod Voronov

We characterize the number of points for which there exist non-empty Terracini sets of points in $\mathbb{P}^n$. Then we study minimally Terracini finite sets of points in $\mathbb{P}^n$ and we obtain a complete description in the case of…

Algebraic Geometry · Mathematics 2024-11-18 Edoardo Ballico , Maria Chiara Brambilla

Any planar shape $P\subset \mathbb{C}$ can be embedded isometrically as part of the boundary surface $S$ of a convex subset of $\mathbb{R}^3$ such that $\partial P$ supports the positive curvature of $S$. The complement $Q = S \setminus P$…

Dynamical Systems · Mathematics 2016-12-02 Laura DeMarco , Kathryn Lindsey

We study maximal subalgebras of an arbitrary finite dimensional algebra over a field, and obtain full classification/description results of such algebras. This is done by first obtaining a complete classification in the semisimple case, and…

Rings and Algebras · Mathematics 2017-08-31 Miodrag Iovanov , Alexander Sistko

A coreset (or core-set) of an input set is its small summation, such that solving a problem on the coreset as its input, provably yields the same result as solving the same problem on the original (full) set, for a given family of problems…

Machine Learning · Computer Science 2019-10-22 Ibrahim Jubran , Alaa Maalouf , Dan Feldman

Let $f_{1}, \ldots, f_{k}$ be polynomials defining an algebraic set in affine $n$-space over a finite field. Suppose $k>n$. We prove that there exists a system of polynomials $g_{1}, \ldots, g_{n}$, each being a linear combination with…

Algebraic Geometry · Mathematics 2022-04-26 Stefan Barańczuk

Qualitative calculi play a central role in representing and reasoning about qualitative spatial and temporal knowledge. This paper studies distributive subalgebras of qualitative calculi, which are subalgebras in which (weak) composition…

Artificial Intelligence · Computer Science 2015-06-02 Zhiguo Long , Sanjiang Li

Let $H_n^{(3)}$ be a 3-uniform linear hypergraph, i.e. any two edges have at most one vertex common. A special hypergraph, {\em wicket}, is formed by three rows and two columns of a $3 \times 3$ point matrix. In this note, we give a new…

Combinatorics · Mathematics 2025-11-14 Jakob Führer , Jozsef Solymosi

We give a construction of an infinite set of points $A$ in $\mathbb{R}^2$ such that any subset $P\subseteq A$ has a constant density subset $P'$ with no three points collinear and yet $A$ cannot be separated into finitely many subsets such…

Combinatorics · Mathematics 2026-02-26 Moe Putterman , Mehtaab Sawhney , Gregory Valiant

We construct monoid algebras which satisfy the ascending chain condition on principal ideals and which have the property that every nonempty subset of $\mathbb{N}_{\ge 2}$ occurs as a length set.

Commutative Algebra · Mathematics 2024-04-18 Alfred Geroldinger , Felix Gotti

Let $\Pi_q$ be an arbitrary finite projective plane of order $q$. A subset $S$ of its points is called saturating if any point outside $S$ is collinear with a pair of points from $S$. Applying probabilistic tools we improve the upper bound…

Combinatorics · Mathematics 2017-11-28 Zoltán Lóránt Nagy