Related papers: Enumeration of Vuza Canons
Irrespective of whether n is prime, prime power with exponent >1, or composite, the group U_n of units of Z_n can sometimes be obtained as the direct product of cyclic groups generated by x, x+k and x+2k, for x, k in Z_n. Indeed, for many…
For an inner function $\theta$ with $\theta'\in\mathcal N$, where $\mathcal N$ is the Nevanlinna class, several problems are posed in connection with the canonical (inner-outer) factorization of $\theta'$.
We present RandomizedCCA, a randomized algorithm for computing canonical analysis, suitable for large datasets stored either out of core or on a distributed file system. Accurate results can be obtained in as few as two data passes, which…
We give a new expression for the number of factorizations of a full cycle into an ordered product of permutations of specified cycle types. This is done through purely algebraic means, extending work of Biane. We deduce from our result a…
New formulas for approximation of zeta-constants were derived on the basis of a number-theoretic approach constructed for the irrationality proof of certain classical constants. Using these formulas it's possible to approximate certain…
A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…
In Mathematical Music theory, the Aperiodic Tiling Complements Problem consists in finding all the possible aperiodic complements of a given rhythm $A$. The complexity of this problem depends on the size of the period $n$ of the canon and…
This note discusses an interesting matrix factorization called the CUR Decomposition. We illustrate various viewpoints of this method by comparing and contrasting them in different situations. Additionally, we offer a new characterization…
Quantum canonical transformations are defined in analogy to classical canonical transformations as changes of the phase space variables which preserve the Dirac bracket structure. In themselves, they are neither unitary nor non-unitary. A…
We show that every unramified morphism X->Y has a canonical and universal factorization X->E->Y where the first morphism is a closed embedding and the second is etale (but not separated).
The dense amalgam is an operation (introduced in arXiv:1410.4989) which to any finite collection of metrizable compacta associates canonically some new highly disconnected compact metrisable space in which embedded copies of the initial…
We introduce a new approach to an enumerative problem closely linked with the geometry of branched coverings; that is, we study the number of ways a permutation can be decomposed into a product of a given number of 2-cycles, 3-cycles, etc.…
We introduce the factorization graph of a finite group and study its connectedness and forbidden structures. We characterize all finite groups with connected factorization graphs and classify those with connected bipartite factorization…
Rauzy classes define a partition of the set of irreducible (or indecomposable) permutations. They were defined by G. Rauzy as part of an induction algorithm for interval exchange transformations. In this article we prove an explicit formula…
We exhibit a quantum algorithm for determining the zeta function of a genus g curve over a finite field F_q, which is polynomial in g and log(q). This amounts to giving an algorithm to produce provably random elements of the class group of…
For a (non-unit) Pisot number $\beta$, several collections of tiles are associated with $\beta$-numeration. This includes an aperiodic and a periodic one made of Rauzy fractals, a periodic one induced by the natural extension of the…
The article shows how the factorization of an arbitrary Lorentz transformation is performed. That is, representation of an arbitrary Lorentz transformation as a sequence of spatial rotation and boost or boost and spatial rotation. Relations…
Nonunique factorization in commutative monoids is often studied using factorization invariants, which assign to each monoid element a quantity determined by the factorization structure. For numerical monoids (co-finite, additive submonoids…
We give an algorithm for factoring quadratic polynomials over any UFD, Z in particular. We prove the correctness of this algorithm and give examples over Z and Z[i].
We re-examine a practical aspect of combinatorial fuzzy problems of various types, including search, counting, optimization, and decision problems. We are focused only on those fuzzy problems that take series of fuzzy input objects and…