Related papers: Gaps of Binary Numerical Semigroups and of Binary …

In this paper we study some sophisticated supercongruences involving dual sequences. For $n=0,1,2,\ldots$ define $$d_n(x)=\sum_{k=0}^n\binom nk\binom xk2^k$$ and $$s_n(x)=\sum_{k=0}^n\binom nk\binom xk\binom{x+k}k=\sum_{k=0}^n\binom…

In this paper we study the following set\[A=\{p(n)+2^nd \mod 1: n\geq 1\}\subset [0.1],\] where $p$ is a polynomial with at least one irrational coefficient on non constant terms, $d$ is any real number and for $a\in [0,\infty)$, $a \mod 1$…

Given a separable nonconstant polynomial $f(x)$ with integer coefficients, we consider the set $S$ consisting of the squarefree parts of all the rational values of $f(x)$, and study its behavior modulo primes. Fixing a prime $p$, we…

This paper investigates polynomial remainder codes with non-pairwise coprime moduli. We first consider a robust reconstruction problem for polynomials from erroneous residues when the degrees of all residue errors are assumed small, namely…

We study the spaces $Q_m$ of $m$-quasi-invariant polynomials of the symmetric group $S_n$ in characteristic $p$. Using the representation theory of the symmetric group we describe the Hilbert series of $Q_m$ for $n=3$, proving a conjecture…

Let $q$ be a prime. We classify the odd primes $p\neq q$ such that the equation $x^2\equiv q\pmod{p}$ has a solution, concretely, we find a subgroup $\mathbb{L}_{4q}$ of the multiplicative group $\mathbb{U}_{4q}$ of integers relatively…

Let $p\geq3$ be a large prime and let $n(p)\geq2$ denotes the least quadratic nonresidue modulo $p$. This note sharpens the standard upper bound of the least quadratic nonresidue from the unconditional upper bound $n(p)\ll…

We consider Bernoulli measures $\mu_p$ on the interval $[0,1]$. For the standard Lebesgue measure the digits $0$ and $1$ in the binary representation of real numbers appear with an equal probability $1/2$. For the Bernoulli measures, the…

For a nonnegative integer $p$, we give explicit formulas for the $p$-Frobenius number and the $p$-genus of generalized Fibonacci numerical semigroups. Here, the $p$-numerical semigroup $S_p$ is defined as the set of integers whose…

Suppose that an infinite set $A$ occupies at most $\frac{1}{2}(p+1)$ residue classes modulo $p$, for every sufficiently large prime $p$. The squares, or more generally the integer values of any quadratic, are an example of such a set. By…

We consider symmetric polynomials, p, in the noncommutative free variables (x_1, x_2, ..., x_g). We define the noncommutative complex hessian of p and we call a noncommutative symmetric polynomial noncommutative plurisubharmonic if it has a…

Given a power $q$ of a prime number $p$ and "nice" polynomials $f_1,...,f_r\in\bbF_q[T,X]$ with $r=1$ if $p=2$, we establish an asymptotic formula for the number of pairs $(a_1,a_2)\in\bbF_q^2$ such that…

Expansive polynomials (whose roots are greater than 1 in modulus) often arise in dynamical systems and other computational problems. This paper examines the expansivity gap (the gap between 1 and the smallest modulus of the roots) of these…

We prove the following conjecture of Furstenberg (1969): if $A,B\subset [0,1]$ are closed and invariant under $\times p \mod 1$ and $\times q \mod 1$, respectively, and if $\log p/\log q\notin \mathbb{Q}$, then for all real numbers $u$ and…

We construct here the first known examples of non-split sharply 2-transitive groups of bounded exponent in odd positive characteristic for every large enough prime $p \equiv 3 \pmod{4}$. In fact, we show that there are countably many…

A numerical semigroup is a submonoid of ${\mathbb Z}_{\ge 0}$ whose complement in ${\mathbb Z}_{\ge 0}$ is finite. For any set of positive integers $a,b,c$, the numerical semigroup $S(a,b,c)$ formed by the set of solutions of the inequality…

For finite p-groups P of class 2 and exponent p the following are invariants of fully refined central decompositions of P: the number of members in the decomposition, the multiset of orders of the members, and the multiset of orders of…

Residue number systems based on pairwise relatively prime moduli are a powerful tool for accelerating integer computations via the Chinese Remainder Theorem. We study a structured family of moduli of the form $2^n - 2^k + 1$, originally…

The classic example of a low-discrepancy sequence in $\mathbb{Z}_p$ is $(x_n) = an+b$ with $a \in \mathbb{Z}_p^x$ and $b \in \mathbb{Z}_p$. Here we address the non-linear case and show that a polynomial $f$ generates a low-discrepancy…

Let $q$ be an odd prime and $B = \{b_{j}\}_{j=1}^{l}$ be a finite set of nonzero integers that does not contain a perfect $q^{th}$ power. We show that $B$ has a $q^{th}$ power modulo every prime $p \neq q$ and not dividing $\prod_{b\in B}…