Related papers: Beyond uniform cyclotomy
The Clifford hierarchy is a foundational concept for universal quantum computation (UQC). It was introduced to show that UQC can be realized via quantum teleportation, given access to certain standard resources. While the full structure of…
This work sets the non isotropic noncentral elliptical shape distributions via QR decomposition in the context of zonal polynomials, avoiding the invariant polynomials and the open problems for their computation. The new shape distributions…
{A cyclic subspace code is a union of the orbits of subspaces contained in it. In a recent paper, Gluesing-Luerssen et al. (Des. Codes Cryptogr. 89, 447-470, 2021) showed that the study of the distance distribution of a single orbit cyclic…
Many statistical models are algebraic in that they are defined by polynomial constraints or by parameterizations that are polynomial or rational maps. This opens the door for tools from computational algebraic geometry. These tools can be…
Unit group computations are a cryptographic primitive for which one has a fast quantum algorithm, but the required number of qubits is $\tilde O(m^5)$. In this work we propose a modification of the algorithm for which the number of qubits…
We give explicit upper bounds for coefficients of polynomials appearing in Gauss-Kra\"{i}tchik formula for cyclotomic polynomials. We use a certain relation between elementary symmetric polynomials and power sums polynomials.
We study polytopes defined by inequalities of the form $\sum_{i\in I} z_{i}\leq 1$ for $I\subseteq [d]$ and nonnegative $z_i$ where the inequalities can be reordered into a matrix inequality involving a column-convex $\{0,1\}$-matrix. These…
Marginal polytopes are important geometric objects that arise in statistics as the polytopes underlying hierarchical log-linear models. These polytopes can be used to answer geometric questions about these models, such as determining the…
In 1920, P. A. MacMahon generalized the (classical) notion of divisor sums by relating it to the theory of partitions of integers. In this paper, we extend the idea of MacMahon. In doing so we reveal a wealth of divisibility theorems and…
In this article, we develop new methods for counting integral orbits having bounded invariants that lie inside the cusps of fundamental domains for coregular representations. We illustrate these methods for a representation of cardinal…
Beginning in 2006, G. Gentili and D.C. Struppa developed a theory of regular quaternionic functions with properties that recall classical results in complex analysis. For instance, in each Euclidean ball centered at 0 the set of regular…
This is the first paper in a series introducing a generalized Fredholm theory in a new class of smooth spaces called polyfolds. The theory will be illustrated in upcoming papers by applications to Floer Theory, Gromov-Witten Theory and…
A new picture of Quantum Mechanics based on the theory of groupoids is presented. This picture provides the mathematical background for Schwinger's algebra of selective measurements and helps to understand its scope and eventual…
A Galois unitary is a generalization of the notion of anti-unitary operators. They act only on those vectors in Hilbert space whose entries belong to some chosen number field. For Mutually Unbiased Bases the relevant number field is a…
Given a finite transitive permutation group $G$, we investigate number fields $F/\mathbb{Q}$ of Galois group $G$ whose discriminant is only divisible by small prime powers. This generalizes previous investigations of number fields with…
It is known that Euler numbers, defined as the Taylor coefficients of the tangent and secant functions, count alternating permutations in the symmetric group. Springer defined a generalization of these numbers for each finite Coxeter group…
C. F. Gauss discovered a beautiful formula for the number of irreducible polynomials of a given degree over a finite field. Assuming just a few elementary facts in field theory and the exclusion-inclusion formula, we show how one see the…
We show that Galois theory of cyclotomic number fields provides a powerful tool to construct systematically integer-valued matrices commuting with the modular matrix S, as well as automorphisms of the fusion rules. Both of these…
Geometric number systems, obtained by extending the real number system to include new anticommuting square roots of +1 and -1, provide a royal road to higher mathematics by largely sidestepping the tedious languages of tensor analysis and…
Let $p$ be a prime. In this article, we prove the Smoothness Theorem, which asserts that a $(1,1)$-cyclotomic pair is $(n,1)$-cyclotomic, for all $n \geq 1$. In the particular case of Galois cohomology, the Smoothness Theorem provides a new…