Related papers: Almost homomorphisms between the Boolean cube and …

We give new proofs for many injectivity results in analysis that make more careful use of the duality between unital abelian C*-algebras and compact Hausdorff spaces. We then extend many of these results to incorporate group actions. Our…

The $f$-invariant is an isomorphism invariant of free-group measure-preserving actions introduced by Lewis Bowen in [arXiv:0802.4294], where it was used to show that two finite-entropy Bernoulli shifts over a finitely generated free group…

We pose 100 new conjectures on representations involving primes or related things, which might interest number theorists and stimulate further research. Below are five typical examples: (i) For any positive integer $n$, there exists…

Let $c:SU(n)\rightarrow PSU(n)=SU(n)/\mathbb{Z}_{n}$ be the quotient map of the special unitary group $SU(n)$ by its center subgroup $\mathbb{Z}_{n}$. We determine the induced homomorphism $c^{\ast}:$ $H^{\ast}(PSU(n))\rightarrow…

In the present note we prove an asymptotically tight relation between additive and multiplicative complexity of Boolean functions with respect to implementation by circuits over the basis {+,*,1}.

We find the group of equivalence transformations for equations of the form $y''= A(x)y' + F(y),$ where $A$ and $F$ are arbitrary functions. We then give a complete group classification of these families of equations, using a direct method…

We present the geometry lying behind counting twin prime polynomials in $\mathbb{F}_q[T]$ in general. We compute cohomology and explicitly count points by means of a twisted Lefschetz trace formula applied to these parametrizing varieties…

In this paper we consider the computational complexity of the following problem. Let $f$ be a Boolean polynomial. What value of $f$, 0 or 1, is taken more frequently? The problem is solved in polynomial time for polynomials of degrees 1,2.…

Let $\mu$ be a probability measure on $\mathbb{Z}$ that is not a Dirac mass and that has finite support. We prove that if the coefficients of a monic polynomial $f(x)\in\mathbb{Z}[x]$ of degree $n$ are chosen independently at random…

The McKay Conjecture (MC) asserts the existence of a bijection between the (inequivalent) complex irreducible representations of degree coprime to $p$ ($p$ a prime) of a finite group $G$ and those of the subgroup $N$, the normalizer of…

Let $q$ be a prime power. We construct stable polynomials of the form $b^{m-1}(x+a)^m+c(x+a)+d$ over a finite field $\mathbb{F}_{q}$ for $m=2,3,4$ by Capelli's lemma. When $m=3$ and $q$ is even, we confirm the conjecture of Ahmadi and…

Given an abelian algebraic group $A$ over a global field $F$, $\alpha \in A(F)$, and a prime $\ell$, the set of all preimages of $\alpha$ under some iterate of $[\ell]$ generates an extension of $F$ that contains all $\ell$-power torsion…

Consider a quadratic polynomial $f\left(\xi_{1},\dots,\xi_{n}\right)$ of independent Bernoulli random variables. What can be said about the concentration of $f$ on any single value? This generalises the classical Littlewood--Offord problem,…

In this paper we generalize the result of Fouvry and Iwaniec dealing with prime values of the quadratic form $x^2 + y^2$ with one input restricted to a thin subset of the integers. We prove the same result with an arbitrary primitive…

The Bergelson-Leibman theorem states that if P_1, ..., P_k are polynomials with integer coefficients, then any subset of the integers of positive upper density contains a polynomial configuration x+P_1(m), ..., x+P_k(m), where x,m are…

Consider a monic polynomial of degree $n$ whose subleading coefficients are independent, identically distributed, nondegenerate random variables having zero mean, unit variance, and finite moments of all orders, and let $m \geq 0$ be a…

We study the distribution of the Galois group of a random $q$-additive polynomial over a rational function field: For $q$ a power of a prime $p$, let $f=X^{q^n}+a_{n-1}X^{q^{n-1}}+\ldots+a_1X^q+a_0X$ be a random polynomial chosen uniformly…

We describe a straightforward method to generate a random prime q such that the multiplicative group GF(q)* also has a random large prime-order subgroup. The described algorithm also yields this order p as well as a p'th primitive root of…

The subset of quadratic primes {p = an^2 + bn + c : n => 1} generated by an irreducible polynomial f(x) = ax^2 + bx + c over the integers is widely believed to be an unbounded subset of prime numbers. This note provides the details of a…

It is shown that a wide range of probabilities and limiting probabilities in finite classical groups have integral coefficients when expanded as a power series in 1/q. Moreover it is proved that the coefficients of the limiting…