Related papers: Multiple Gauss sums

We develop several notions of multiplicity for linear factors of multivariable polynomials over different arithmetics (hyperfields). The key example is multiplicities over the hyperfield of signs, which encapsulates the arithmetic of…

General factors are a generalization of matchings. Given a graph $G$ with a set $\pi(v)$ of feasible degrees, called a degree constraint, for each vertex $v$ of $G$, the general factor problem is to find a (spanning) subgraph $F$ of $G$…

It is known that there are infinitely-many prime numbers which take the form of a polynomial of degree one with integer coefficients, this is Dirichlet's theorem. We use an elementary sieving argument together with bounds on the prime…

In this paper, it is established that every sufficiently large positive integer $n$ subject to $n\equiv0\pmod2$ can be represented as a sum of one square of prime and seventeen fifth powers of primes, which gives an enhancement upon the…

Assume $G$ is a connected reductive algebraic group defined over $\bar{\mathbb{F}_p}$ such that $p$ is good prime for $G$. Furthermore we assume that $Z(G)$ is connected and $G/Z(G)$ is simple of classical type. Let $F$ be a Frobenius…

We provide infinitely many solutions of a Dirichlet problem on balls.

The famous strongly binary Goldbach's conjecture asserts that every even number $2n \geq 8$ can always be expressible as the sum of two distinct odd prime numbers. We use a new approach to dealing with this conjecture. Specifically, we…

Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. In this paper, it is proved that for every sufficiently large even integer $N$, the equation \begin{equation*}…

We prove the existence of infinitely many solutions to a class of non-symmetric Dirichlet problems with exponential nonlinearities. Here the domain $\Omega \subset\subset \mathbb{R}^{2l}$ where $2l$ is the order of the equation. Considered…

We introduce a natural definition for sums of the form \[ \sum_{\nu=1}^x f(\nu) \] when the number of terms x is a rather arbitrary real or even complex number. The resulting theory includes the known interpolation of the factorial by the…

We give thirty-two diverse proofs of a small mathematical gem--the fundamental Euler sum identity zeta(2,1)=zeta(3) =8zeta(\bar 2,1). We also discuss various generalizations for multiple harmonic (Euler) sums and some of their many…

This paper establishes the theoretical foundations for the asymptotic separability of Gaussian Mixture Models (GMMs) in high dimensions by extending the classical Feldman-H\'ajek theorem. We first prove that a countable mixture of Gaussian…

In this paper, we will explicitly calculate Gauss sums for the general linear groups and the special linear groups over $\Bbb Z_n$, where $\Bbb Z_n=\Bbb Z/n \Bbb Z$ and $n>0$ is an integer. For $r$ being a positive integer, the formulae of…

This paper investigates the Erd\H{o}s distinct subset sums problem in $\mathbb{Z}^k$. Beyond the classical variance method, using alternative statistical quantities like $\mathbb{E}[\|X\|_1]$ and $\mathbb{E}[\|X\|_3^3]$ can yield better…

We study the gauge symmetry factorizability by boundary conditions on intervals of any dimensions. With Dirichlet-Neumann BCs, the Kaluza-Klein decomposition in five-dimension for arbitrary gauge group can always be factorized into that for…

It is well known that the classical Gauss sum, normalized by the square-root number of terms, takes only finitely many values. If one restricts the range of summation to a subinterval, a much richer structure emerges. We prove a limit law…

We prove upper bounds on the face numbers of simplicial complexes in terms on their girths, in analogy with the Moore bound from graph theory. Our definition of girth generalizes the usual definition for graphs.

The multifractal formalism for measures hold whenever the existence of corresponding Gibbs-like measures supported on the singularities sets holds. In the present work we tried to relax such a hypothesis and introduce a more general…

We obtain explicit estimates for the mixed character sum $S= S(\chi,g,f,p^m) = \sum_{x=1}^{p^m} \chi (g(x)) e_{p^m}(f(x))$, where $p^m$ is a prime power, $\chi$ is a multiplicative character mod $p^m$ and $f,g$ are rational functions over…

In this paper, we consider the problem of Mutually Unbiased Bases in prime dimension $d$. It is known to provide exactly $d+1$ mutually unbiased bases. We revisit this problem using a class of circulant $d \times d$ matrices. The…