Related papers: Formalizing the Solution to the Cap Set Problem
We establish asymptotic lower bounds for the number of elliptic curves over $\mathbb{Q}$ with prescribed entanglement of division fields, ordered by naive height. Such elliptic curves are obtained as $1$-parameter families arising from…
The isomorphism problem for planar graphs is known to be efficiently solvable. For planar 3-connected graphs, the isomorphism problem can be solved by efficient parallel algorithms, it is in the class $AC^1$. In this paper we improve the…
Gurumuhkani et al. (CCC'24) introduced the local enumeration problem $Enum(k, t)$ as follows: for a natural number $k$ and a parameter $t$, given an $n$-variate $k$-CNF with no satisfying assignment with Hamming weight less than $t(n)$,…
We prove a power saving over the trivial bound for the number of cohomological cuspidal automorphic representations of fixed level and growing weight on $GL_3/\mathbb{Q}$, by adapting the methods of our earlier paper on $GL_2$.
Under a weakened version of Hardy-Littlewood Conjecture on the number of representations in Goldbach problem, J. H. Fei proved bounds for the Siegel zeros. Recently G. Bhowmik and K. Halupczok generalized Fei's result under a weaker…
Lipschitz decomposition is a useful tool in the design of efficient algorithms involving metric spaces. While many bounds are known for different families of finite metrics, the optimal parameters for $n$-point subsets of $\ell_p$, for $p >…
A subset $S$ of an abelian group $G$ is called $3$-$\mathrm{AP}$ free if it does not contain a three term arithmetic progression. Moreover, $S$ is called complete $3$-$\mathrm{AP}$ free, if it is maximal w.r.t. set inclusion. One of the…
The ternary Goldbach conjecture states that every odd number n>=7 is the sum of three primes. The estimation of sums of the form \sum_{p\leq x} e(\alpha p), \alpha = a/q + O(1/q^2), has been a central part of the main approach to the…
The problem of deciding the validity (QSAT) of quantified Boolean formulas (QBF) is a vivid research area in both theory and practice. In the field of parameterized algorithmics, the well-studied graph measure treewidth turned out to be a…
We establish the existence of positive solutions to a general class of overdetermined semilinear elliptic boundary problems on suitable bounded open sets $\Omega\subset\mathbb{R}^n$. Specifically, for $n\leq 4$ and under mild technical…
The 3-\textsc{Hitting Set} problem is also called the \textsc{Vertex Cover} problem on 3-uniform hypergraphs. In this paper, we address kernelizations of the \textsc{Vertex Cover} problem on 3-uniform hypergraphs. We show that this problem…
In this paper we rectify two previous results found in the literature. Our work leads to a new upper bound for the largest sum-free subset of $[1,n]$ with lowest value in $\left [\frac{n}{3},\frac{n}{2}\right ]$, and the identification of…
Frameproof codes are used to fingerprint digital data. It can prevent copyrighted materials from unauthorized use. In this paper, we study upper and lower bounds for $w$-frameproof codes of length $N$ over an alphabet of size $q$. The upper…
In this article we present a characterization of elliptic curves defined over a finite field Fq which possess a rational subgroup of order three. There are two posible cases depending on the rationality of the points in these groups. We…
An "edge guard set" of a plane graph $G$ is a subset $\Gamma$ of edges of $G$ such that each face of $G$ is incident to an endpoint of an edge in $\Gamma$. Such a set is said to guard $G$. We improve the known upper bounds on the number of…
Ellenberg--Venkatesh proved in 2007 that $h_3(d) \ll_\epsilon |d|^{1/3 + \epsilon}$, where $h_3(d)$ denotes the size of the $3$-torsion of the class group of $\mathbb{Q}(\sqrt{d})$. We improve this bound to $h_3(d) \ll_\epsilon |d|^{\kappa…
For an integer $q\ge 2$, a perfect $q$-hash code $C$ is a block code over $[q]:=\{1,\ldots,q\}$ of length $n$ in which every subset $\{\mathbf{c}_1,\mathbf{c}_2,\dots,\mathbf{c}_q\}$ of $q$ elements is separated, i.e., there exists…
In this paper we solve three open problems on maximal curves with Frobenius dimension 3. In particular, we prove the existence of a maximal curve with order sequence (0,1,3,q).
In this work complete caps in $PG(N,q)$ of size $O(q^{\frac{N-1}{2}}\log^{300} q)$ are obtained by probabilistic methods. This gives an upper bound asymptotically very close to the trivial lower bound $\sqrt{2}q^{\frac{N-1}{2}}$ and it…
We consider the problem of estimating the error term $\mathcal{E}_{q}(x)=\big|\mathbb{Z}^{2q+1}\cap\delta_{x}\mathcal{B}\big|-\textit{vol}\big(\mathcal{B}\big)x^{2q+2}$ which occurs in the counting of lattice points in Heisenberg dilates of…