Related papers: The Fermat's and Euler's congruence theorems
Group algebras of permutations have proved highly useful in solving a number of problems in large N gauge theories. I review the use of permutations in classifying gauge invariants in one-matrix and multi-matrix models and computing their…
We show that if a numerical method is posed as a sequence of operators acting on data and depending on a parameter, typically a measure of the size of discretization, then consistency, convergence and stability can be related by a…
Determining whether a given integer is prime or composite is a basic task in number theory. We present a primality test based on quantum order finding and the converse of Fermat's theorem. For an integer $N$, the test tries to find an…
We prove a theorem about the derivation algebra of the tensor product of two algebras. As an application, we determine the derivation algebra of the fixed point algebra of the tensor product of two algebras, with respect to the tensor…
The increasing demand for Fourier transforms on geometric algebras has resulted in a large variety. Here we introduce one single straight forward definition of a general geometric Fourier transform covering most versions in the literature.…
A natural N=1 supersymmetric extension of the Euler top, which introduces exactly one fermionic counterpart for each bosonic degree of freedom, is considered. The equations of motion, their symmetries and integrals of motion are given. It…
Any procedure applied to data, and any quantity derived from data, is required to respect the nature and symmetries of the data. This axiom applies to refinement procedures and multiresolution transforms as well as to more basic operations…
The aim of this paper is to try to establish a generic model for the problem that several multivariable number-theoretic functions represent simultaneously primes for infinitely many integral points. More concretely, we introduced briefly…
In this article, we derive a congruence property of particular sum rules involving prime numbers. The resulting expression involves Bernoulli numbers and polynomials, for which we obtain, as a consequence, a general congruence relation as…
We consider the coincidence problem for the square lattice that is translated by an arbitrary vector. General results are obtained about the set of coincidence isometries and the coincidence site lattices of a shifted square lattice by…
In this paper, we propose extensions for the classical Kummer test, which is a very far-reaching criterion that provides sufficient and necessary conditions for convergence and divergence of series of positive terms. Furthermore, we present…
We show that three fixed point structures equipped with (sequential) composition, a sum operation, and a fixed point operation share the same valid equations. These are the theories of (context-free) languages, (regular) tree languages, and…
The theory of permutation orbifolds is reviewed and applied to the study of symmetric product orbifolds and the congruence subgroup problem. The issue of discrete torsion, the combinatorics of symmetric products, the Galois action and…
In this paper we consider permutations of sequences of partitions, obtaining a result which parallels von Neumann's theorem on permutations of dense sequences and uniformly distributed sequences of points.
An equivalence relation in the symmetric group, where is a positive integer has been considered. An algorithm for calculation of the number of the equivalence classes by this relation for arbitrary integer has been described.
In our work we give the examples using Fermat's Last Theorem for solving some problems from algebra, geometry and number theory
We discuss the notion of the orbifold transform, and illustrate it on simple examples. The basic properties of the transform are presented, including transitivity and the exponential formula for symmetric products. The connection with the…
A finite quantum system evolving unitarily equilibrates in a probabilistic fashion. In the general many-body setting the time-fluctuations of an observable \mathcal{A} are typically exponentially small in the system size. We consider here…
A general form factor formula for the scaling Z(N)-Ising model is constructed. Exact expressions for matrix elements are obtained for several local operators. In addition, the commutation rules for order, disorder parameters and para-Fermi…
Quantification starts with sum and product rules that express combination and partition. These rules rest on elementary symmetries that have wide applicability, which explains why arithmetical adding up and splitting into proportions are…