Related papers: Fermat test with gaussian base and Gaussian pseudo…

We generalize the congruences of Friedmann-Tamarkine (1909), Lehmer (1938), Ernvall-Metsankyla (1991) on the sums of powers of integers weighted by powers of the Fermat quotients to the next Fermat quotient power, namely to the third power…

We discuss classical algorithms for approximating the largest eigenvalue of quantum spin and fermionic Hamiltonians based on semidefinite programming relaxation methods. First, we consider traceless $2$-local Hamiltonians $H$ describing a…

We introduce a new set of prime numbers functions including an exact Generating Function and a Discriminating Function of Prime Numbers neither based on prime number tables nor on algorithms. Instead these functions are defined in terms of…

The minimal base size $b(G)$ for a permutation group $G$, is a widely studied topic in the permutation group theory. Z. Halasi and K. Podoski proved that $b(G)\leq 2$ for coprime linear groups. Motivated by this result and the probabilistic…

The aim of this paper is to give a precise asymptotic description of some eigenvalue statistics stemming from random matrix theory. More precisely, we consider random determinants of the GUE, Laguerre, Uniform Gram and Jacobi beta ensembles…

This article deals with a conjecture, introduced in [GQ] (hereinafter $SFLT2$), which generalizes the second case of Fermat's Last Theorem: {\it Let $p>3$ be a prime. The diophantine equation $\frac{u^p+v^p}{u+v}=w_1^p$ with $u,v,u+v,…

Let $p$ be a prime number and let $k$ be an algebraically closed field of characteristic $p$. A $BT_1$ group scheme over $k$ is a finite commutative group scheme which arises as the kernel of $p$ on a $p$-divisible (Barsotti--Tate) group.…

In this paper, we apply stack theoretic ideas to the classification problem in Dieudonn\'e theory. First, we use crystalline cohomology of classifying stacks to directly reconstruct the classical Dieudonn\'e module of a finite, $p$-power…

A connection between representation of compact groups and some invariant ensembles of Hermitian matrices is described. We focus on two types of invariant ensembles which extend the Gaussian and the Laguerre Unitary ensembles. We study them…

A central question in mathematics and computer science is the question of determining whether a given ideal $I$ is prime, which geometrically corresponds to the zero set of $I$, denoted $Z(I)$, being irreducible. The case of principal…

In this paper, we study a class of functions defined recursively on the set of natural numbers in terms of the greatest common divisor algorithm of two numbers and requiring a minimality condition. These functions are permutations, products…

Given a discrete measured groupoid $\mathcal{G}$, we study properties of the corresponding von Neumann algebra $L(\mathcal{G})$ using the techniques of Popa's deformation/rigidity theory. More specifically, we define and study the Gaussian…

Let $m$ be a Carmichael number and let $L$ be the least common multiple of $p-1$, where $p$ runs over the prime factors of $m$. We determine all the Carmichael numbers $m$ with a Fermat prime factor such that $L=2^{\alpha}P^2$, where $k\in…

Let $G$ be a transitive permutation group on a set $\Omega$, and suppose $G_{\alpha}\cap G_{\beta}=1$ for some distinct $\alpha, \beta\in\Omega$. The Saxl graph $\Sigma(G)$ of $(G, \Omega)$ is defined as the graph with vertex set $\Omega$,…

We study permutation groups of given minimal degree without the classical primitivity assumption. We provide sharp upper bounds on the order of a permutation group of minimal degree m and on the number of its elements of any given support.…

We study four-point functions in Chern-Simons vector models in the large $N$ limit. We compute the four-point function of the scalar primary to all orders in the `t Hooft coupling $\lambda=N/k$ in $U(N)_k$ Chern-Simons theory coupled to a…

We introduce a new class of pseudoprimes-so called "overpseudoprimes to base $b$", which is a subclass of strong pseudoprimes to base $b$. Denoting via $|b|_n$ the multiplicative order of $b$ modulo $n$, we show that a composite $n$ is…

Let $G$ be a transitive permutation group on $\Omega$ with two points $\alpha, \beta\in\Omega$ such that $G_{\alpha}\cap G_{\beta}=1$. The Saxl graph $\Sigma(G)$ of the pair $(G,\Omega)$ is the graph with vertex set $\Omega$, while two…

We describe a web of connections between the following topics: the mathematical theory of voting and social choice; the computational complexity of the Maximum Cut problem; the Gaussian Isoperimetric Inequality and Borell's generalization…

A base for a permutation group $G$ acting on a set $\Omega$ is a sequence $\mathcal{B}$ of points of $\Omega$ such that the pointwise stabiliser $G_{\mathcal{B}}$ is trivial. The base size of $G$ is the size of a smallest base for $G$.…