Related papers: Nathanson heights in finite vector spaces

Let $p$ be a prime number with $p\equiv 2\pmod{3}$ and let $n\ge 1$ be a dimension. It is known that a sum-free subset of ${\mathbb F}_p^n$ can have at most the size $\frac13(p+1)p^{n-1}$ and that, up to automorphisms of ${\mathbb F}_p^n$,…

This article provides a thorough investigation into Gilbert's Conjecture, pertaining to Hardy spaces in the upper half-space valued in Clifford modules. We explore the conjecture proposed by Gilbert in 1991, which seeks to extend the…

In this paper we present two frameworks in which global maximization of a bounded hessian function over a strongly convex set can be reduced to convex optimization. The first presented framework is a continuation of one of our previous…

Let $G$ be a simple, simply connected algebraic group over an algebraically closed field of prime characteristic $p>0$. Recent work of Kildetoft and Nakano and of Sobaje has shown close connections between two long-standing conjectures of…

The canonical dimension is an invariant attached to admissible representations of p-adic reductive groups, which has only received significant attention in the case of mod-p representations. In the case of complex representations, the…

The height of an algebraic number $\alpha$ is a measure of how arithmetically complicated $\alpha$ is. We say $\alpha$ is totally $p$-adic if the minimal polynomial of $\alpha$ splits completely over the field $\mathbb{Q}_p$ of $p$-adic…

Let $\mathcal{G}$ be the greedy algorithm that, for each $\theta\in (0,1]$, produces an infinite sequence of positive integers $(a_n)_{n=1}^\infty$ satisfying $\sum_{n=1}^\infty 1/a_n = \theta$. For natural numbers $p < q$, let…

The convexity number of a set $X \subset \mathbb{R}^2$ is the minimum number of convex subsets required to cover it. We study the following question: what is the largest possible convexity number $f(n)$ of $\mathbb{R}^2 \setminus S$, where…

We introduce a novel concept of rank for subsets of finite metric spaces E^n_q (the set of all n-dimensional vectors over an alphabet of size q) equipped with the Hamming distance, where the rank R(A) of a subset A is defined as the number…

In the optimization of convex domains under a PDE constraint numerical difficulties arise in the approximation of convex domains in $\mathbb{R}^3$. Previous research used a restriction to rotationally symmetric domains to reduce shape…

Let G be a group and V a finite dimensional representation of G over an algebraically closed field k of characteristic p>0. Let $d_n(V)$ be the number of indecomposable summands of $V^{\otimes n}$ of nonzero dimension mod p. It is easy to…

The $3k-4$ Theorem asserts that, if $A,\,B\subseteq \mathbb Z$ are finite, nonempty subsets with $|A|\geq |B|$ and $|A+B|=|A|+|B|+r< |A|+2|B|-3$, then there are arithmetic progressions $P_A$ and $P_B$ of common difference with $X\subseteq…

Bombieri and Zannier established lower and upper bounds for the limit infimum of the Weil height in fields of totally p-adic numbers and generalizations thereof. In this paper, we use potential theoretic techniques to generalize the upper…

In the subspace sketch problem one is given an $n\times d$ matrix $A$ with $O(\log(nd))$ bit entries, and would like to compress it in an arbitrary way to build a small space data structure $Q_p$, so that for any given $x \in \mathbb{R}^d$,…

The maximal dimension of commutative subspaces of $M_n(\mathbb{C})$ is known. So is the structure of such a subspace when the maximal dimension is achieved. We consider extensions of these results and ask the following natural questions: If…

Let $D$ denote the distance matrix for an $n+1$ point metric space $(X,d)$. In the case that $X$ is an unweighted metric tree, the sum of the entries in $D^{-1}$ is always equal to $2/n$. Such trees can be considered as affinely independent…

We say that a subset of C^n is hypoconvex if its complement is the union of complex hyperplanes. Let D be the closed unit disk in C, T the unit circle. We prove two conjectures of Helton and Marshall. (See ``Frequency domain design and…

We show that the type function of a space with finite asymptotic dimension estimates its Hilbert (or any $l^p$) compression. The method allows to obtain the lower bound of the compression of the lamplighter group $Z\wr Z$, which has…

Let p be a prime and let F_pbar be the algebraic closure of the finite field of p elements. Let f(x) be any one variable rational function over F_pbar with n poles of orders d_1, ...,d_n. Suppose p is coprime to d_i for every i. We prove…

We construct an algorithm for solving the following problem: given a number field $K$, a positive integer $N$, and a positive real number $B$, determine all points in $\mathbb P^N(K)$ having relative height at most $B$. A theoretical…