English
Related papers

Related papers: Simple proofs for Furstenberg sets over finite fie…

200 papers

It has been conjectured by P\'{o}lya and Szeg\"{o} seventy years ago that the planar set which minimizes the first eigenvalue of the Dirichlet-Laplace operator among polygons with $n$ sides and fixed area is the regular polygon. Despite its…

Optimization and Control · Mathematics 2022-03-31 Beniamin Bogosel , Dorin Bucur

We study the number of the vectors determined by two sets in d-dimensional vector spaces over finite fields. We observe that the lower bound of cardinality for the set of vectors can be given in view of an additive energy or the decay of…

Combinatorics · Mathematics 2010-10-11 Doowon Koh , Chun-Yen Shen

We present a general fixed point theorem which can be seen as the quintessence of the principles of proof for Banach's Fixed Point Theorem, ultrametric and certain topological fixed point theorems. It works in a minimal setting, not…

Commutative Algebra · Mathematics 2013-04-02 Katarzyna Kuhlmann , Franz-Viktor Kuhlmann

In 2016, Ellenberg and Gijswijt established a new upper bound on the size of subsets of $\mathbb{F}^n_q$ with no three-term arithmetic progression. This problem has received much mathematical attention, particularly in the case $q = 3$,…

Logic in Computer Science · Computer Science 2019-07-03 Sander R. Dahmen , Johannes Hölzl , Robert Y. Lewis

A set $A\subseteq\mathbb N$ is called $complete$ if every sufficiently large integer can be written as the sum of distinct elements of $A$. In this paper we present a new method for proving the completeness of a set, improving results of…

Combinatorics · Mathematics 2016-09-27 Vitaly Bergelson , David Simmons

Furstenberg and Glasner proved that for an arbitrary k in N, any piecewise syndetic set contains k length arithmetic progression and such collection is also piecewise syndetic in Z: They used algebraic structure of beta N. The above result…

Combinatorics · Mathematics 2019-08-12 Pintu Debnath , Sayan Goswami

The minimum dominating set problem has wide applications in network science and related fields. It consists of assembling a node set of global minimum size such that any node of the network is either in this set or is adjacent to at least…

Physics and Society · Physics 2015-05-14 Jin-Hua Zhao , Yusupjan Habibulla , Hai-Jun Zhou

We use linear programming techniques to find points of absolute minimum over the unit sphere $S^{d}$ in $\mathbb R^{d+1}$ of the total potential of a point configuration $\omega_N\subset S^{d}$ which is a spherical $(2m-1)$-design contained…

Combinatorics · Mathematics 2022-12-12 Sergiy Borodachov

Recently Cortinas-Haesemayer-Walker-Weibel gave affirmative answer to Bass' 1972 question on NK-groups for algebras of essentially finite type over large fields of characteristic 0. Here we give an alternative short proof of this result for…

K-Theory and Homology · Mathematics 2014-02-26 Joseph Gubeladze

A continuous map from R^m to R^N or from C^m to C^N is called k-regular if the images of any $k$ points are linearly independent. Given integers m and k a problem going back to Chebyshev and Borsuk is to determine the minimal value of N for…

Differential Geometry · Mathematics 2016-11-08 Jarosław Buczyński , Tadeusz Januszkiewicz , Joachim Jelisiejew , Mateusz Michałek

Let $\mathbb{F}_q$ be an arbitrary finite field, and $\mathcal{E}$ be a set of points in $\mathbb{F}_q^d$. Let $\Delta(\mathcal{E})$ be the set of distances determined by pairs of points in $\mathcal{E}$. By using the Kloosterman sums,…

Combinatorics · Mathematics 2020-07-31 Thang Pham , Le Anh Vinh

Let $p$ be a fixed prime number, and $q$ a power of $p$. For any curve over $\mathbb{F}_q$ and any local system on it, we have a number field generated by the traces of Frobenii at closed points, known as the trace field. We show that as we…

Number Theory · Mathematics 2024-11-28 Yeuk Hay Joshua Lam

The Euclidean minimum $M(K)$ of a number field $K$ is an important numerical invariant that indicates whether $K$ is norm-Euclidean. When $K$ is a non-CM field of unit rank 2 or higher, Cerri showed $M(K)$, as the supremum in the Euclidean…

Number Theory · Mathematics 2012-07-24 Uri Shapira , Zhiren Wang

Kochen-Specker (KS) sets are fundamental in physics. Every time nature produces bipartite correlations attaining the nonsignaling limit, or two parties always win a nonlocal game impossible to always win classically, is because the parties…

Quantum Physics · Physics 2025-11-10 Adán Cabello

Let $(M,g)$ be a compact manifold and let $-\Delta \phi_k = \lambda_k \phi_k$ be the sequence of Laplacian eigenfunctions. We present a curious new phenomenon which, so far, we only managed to understand in a few highly specialized cases:…

Spectral Theory · Mathematics 2017-06-06 Xiuyuan Cheng , Gal Mishne , Stefan Steinerberger

We consider a minimizing variant of the well-known \emph{No-Three-In-Line Problem}, the \emph{Geometric Dominating Set Problem}: What is the smallest number of points in an $n\times n$~grid such that every grid point lies on a common line…

Computational Geometry · Computer Science 2023-09-29 Oswin Aichholzer , David Eppstein , Eva-Maria Hainzl

Let $f_n(k)$ be the number of subrings of index $k$ in $\mathbb{Z}^n$. We show that results of Brakenhoff imply a lower bound for the asymptotic growth of subrings in $\mathbb{Z}^n$, improving upon lower bounds given by Kaplan, Marcinek,…

Number Theory · Mathematics 2021-07-16 Kelly Isham

Let $X$ be an $n\times m$ matrix of indeterminates over a field $K$ (of sufficiently large characteristic) and $M_t$ the set of $m$-minors of $X$. We consider two objects: (1) the Ress algebra of the polynomial ring $K[X]$ with respect to…

Commutative Algebra · Mathematics 2007-05-23 Winfried Bruns , Aldo Conca

The (weak) Nullstellensatz over finite fields says that if $P_1,\ldots,P_m$ are $n$-variate degree-$d$ polynomials with no common zero over a finite field $\mathbb{F}$ then there are polynomials $R_1,\ldots,R_m$ such that…

Combinatorics · Mathematics 2022-09-14 Guy Moshkovitz , Jeffery Yu

Deciding whether or not two polynomials have isomoprhic splitting fields over the rationals is the Field Isomorphism Problem. We consider polynomials of the form $f_n(x) = x^4-nx^3-6x^2+nx+1$ with $n \neq 3$ a positive integer and we let…

Number Theory · Mathematics 2024-06-18 David L. Pincus , Lawrence C. Washington
‹ Prev 1 8 9 10 Next ›