Related papers: New Nikodym set constructions over finite fields

Let ${\mathbf U}_q^-$ be the negative half of a quantum group of finite type. We construct the canonical basis of ${\mathbf U}_q^-$ by applying the folding theory of quantum groups, and piecewise linear parametrization of canonical basis.…

The following dichotomy is established: A finitely generated, complex Dedekind domain that is not commutative is simple. Weaker versions of this dichotomy are proved for Dedekind prime rings and hereditary noetherian prime rings.

Qudits with local dimension $d>2$ can have unique structure and uses that qubits ($d=2$) cannot. Qudit Pauli operators provide a very useful basis of the space of qudit states and operators. We study the structure of the qudit Pauli group…

Given an uncountable cardinal $\kappa$, we consider the question of whether subsets of the power set of $\kappa$ that are usually constructed with the help of the Axiom of Choice are definable by $\Sigma_1$-formulas that only use the…

We determine all integers $n$ such that $n^2$ has at most three base-$q$ digits for $q \in \{2, 3, 4, 5, 8, 16 \}$. More generally, we show that all solutions to equations of the shape $$ Y^2 = t^2 + M \cdot q^m + N \cdot q^n, $$ where $q$…

Let $G$ be a simple algebraic group over the algebraic closure of $GF(p)$ ($p$ prime), and let $G(q)$ denote a corresponding finite group of Lie type over $GF(q)$, where $q$ is a power of $p$. Let $X$ be an irreducible subvariety of $G^r$…

We construct large subsets of the first $N$ positive integers which avoid certain arithmetic configurations. In particular, we construct a set of order $N^{0.7685}$ lacking the configuration $\{x,x+y,x+y^2\},$ surpassing the $N^{3/4}$ limit…

We propose a polynomial time construction of an $(n,d)$-universal set over alphabet $\Sigma=\{0,1\}$, of size $d\cdot 2^{d+o(d)}\cdot\log n$. This is an improvement over the size, $d^{5}2^{2.66d}\log n$, of an $(n,d)$-universal set…

In this work, we compute the number of $[[n,k]]_d$ stabilizer codes made up of $d$-dimensional qudits, for arbitrary positive integers $d$. In a seminal work by Gross (Ref. [23]) the number of $[[n,k]]_d$ stabilizer codes was computed for…

In this work, we investigate additive complementary dual (ACD) codes and their construction over finite fields $\mathbb{F}_{q^2}$ with respect to the trace inner products, where $q$ is a prime power. First, we associate an additive code…

A fundamental problem in fault-tolerant quantum computation is the tradeoff between universality and dimensionality, exemplified by the the Bravyi-K\"onig bound for $n$-dimensional topological stabilizer codes. In this work, we extend…

In [Bal18] a new method of constructing simplex designs based on cyclic group on $n$ elements has been proposed. One of the claims put forward therein is existence of 3-point simplex 3-design in dimension $d = 3$. In this manuscript we…

Let $\alpha(\mathbb{F}_q^d,p)$ denote the maximum size of a general position set in a $p$-random subset of $\mathbb{F}_q^d$. We determine the order of magnitude of $\alpha(\mathbb{F}_q^2,p)$ up to polylogarithmic factors for all possible…

We briefly report our recent construction of new fuzzy spheres of dimensions d=1,2 covariant under the full orthogonal group O(D), D=d+1. They are built by imposing a suitable energy cutoff on a quantum particle in D dimensions subject to a…

This paper investigates the impossibility of certain $({n^2+n+k}_{n+1})$ configurations. Firstly, for $k=2$, the result of \cite{gropp1992non} that $\frac{n^2+n}{2}$ is even and $n+1$ is a perfect square or $\frac{n^2+n}{2}$ is odd and…

Fix a finite collection of primes $\{ p_j \}$, not containing $2$ or $3$. Using some observations which arose from attempts to solve the SIC-POVMs problem in quantum information, we give a simple methodology for constructing an infinite…

We explore finite-field frameworks for quantum theory and quantum computation. The simplest theory, defined over unrestricted finite fields, is unnaturally strong. A second framework employs only finite fields with no solution to x^2+1=0,…

A set $Q$ in $\mathbb{Z}_+^d$ is a lower set if $(k_1,\dots,k_d)\in Q$ implies $(l_1,\dots,l_d)\in Q$ whenever $0\le l_i\le k_i$ for all $i$. We derive new and refine known results regarding the cardinality of the lower sets of size $n$ in…

We study spherical analogues of Nikodym sets and related maximal functions. In particular, we prove sharp $L^p$-estimates for Nikodym maximal functions associated with spheres. As a corollary, any Nikodym set for spheres must have full…

For each Sophie Germain prime $g \geq 5,$ we construct an absolutely simple polarized abelian variety of dimension $g$ over a finite field, whose automorphism group is a cyclic group of order $4g+2$. We also provide a description on the…