Related papers: Enumeration of Vuza Canons
Factorization -- a simple form of standardization -- is concerned with reduction strategies, i.e. how a result is computed. We present a new technique for proving factorization theorems for compound rewriting systems in a modular way, which…
We give a parameterized generalization of the sum formula for quadruple zeta values. The generalization has four parameters, and is invariant under a cyclic group of order four. By substituting special values for the parameters, we also…
In 2006 T. Brown asked the following question: Given a non-periodic infinite word $x=x_1x_2x_3\cdots$ with values in a non-empty set $\mathbb{A},$ does there exist a finite coloring $\varphi: \mathbb{A}^+\rightarrow C$ relative to which $x$…
Hurwitz numbers count covers of curves satisfying fixed ramification data. Via monodromy representation, this counting problem can be transformed to a problem of counting factorizations in the symmetric group. This and other beautiful…
Recent work on compositional distributional models shows that bialgebras over finite dimensional vector spaces can be applied to treat generalised quantifiers for natural language. That technique requires one to construct the vector space…
We investigate random minimal factorizations of the $n$-cycle, that is, factorizations of the permutation $(1 \, 2 \cdots n)$ into a product of cycles $\tau_1, \ldots, \tau_k$ whose lengths $\ell(\tau_1), \ldots, \ell(\tau_k)$ verify the…
We establish left and right canonical factorizations of Hilbert-space operator-valued functions G(z) that are analytic on neighborhoods of the complex unit circle and the origin 0, and that have the form G(z)=I+F(z) with F(z) taking…
For an arbitrary finite set S of natural numbers greater 1, we construct an integer-valued polynomial f, whose set of lengths in Int(Z) is S. The set of lengths of f is the set of all natural numbers n, such that f has a factorization as a…
We consider the factorization of a rectangular matrix $X $ into a positive linear combination of rank-one factors of the form $u v^\top$, where $u$ and $v$ belongs to certain sets $\mathcal{U}$ and $\mathcal{V}$, that may encode specific…
A factorization of an element $x$ in a monoid $(M, \cdot)$ is an expression of the form $x = u_1^{z_1} \cdots u_k^{z_k}$ for irreducible elements $u_1, \ldots, u_k \in M$, and the length of such a factorization is $z_1 + \cdots + z_k$. We…
Nonlocal and fractional-order models capture effects that classical partial differential equations cannot describe; for this reason, they are suitable for a broad class of engineering and scientific applications that feature multiscale or…
We consider several novel aspects of unique factorization in formal languages. We reprove the familiar fact that the set uf(L) of words having unique factorization into elements of L is regular if L is regular, and from this deduce an…
The Collatz problem is related to the fixed point problem, and is widely used in mathematics. It has attracted a wide range of math enthusiasts, but is still difficult to solve. So, this article aimed to study the extension of the Collatz…
The aim of this note is to survey the factorizations of the Fibonacci infinite word that make use of the Fibonacci words and other related words, and to show that all these factorizations can be easily derived in sequence starting from…
In this manuscript, fractal and fuzzy calculus are summarized. Fuzzy calculus in terms of fractal limit, continuity, its derivative, and integral are formulated. The fractal fuzzy calculus is a new framework that includes fractal fuzzy…
In article, we explore the secondary zeta function $Z(s)$, which is defined as a generalized zeta type of series over imaginary parts of non-trivial zeros of the Riemann zeta function $\zeta(s)$. This function has been analytically…
Using some elementary methods from noncommutative geometry a structure is given to a point of space-time which is different from and simpler than that which would come from extra dimensions. The structure is described by a supplementary…
In the paper the notion of {\em Rauzy scheme} is introduced. From Rauzy graph Rauzy Scheme can be obtaining by uniting sequence of vertices of ingoing and outgoing degree 1 by arches. This notion is a tool to describe Rauzy graph behavior.…
I study the canonical formulation and quantization of some simple parametrized systems, including the non-relativistic parametrized particle and the relativistic parametrized particle. Using Dirac's formalism I construct for each case the…
A unitary (Euclidean) representation of a quiver is given by assigning to each vertex a unitary (Euclidean) vector space and to each arrow a linear mapping of the corresponding vector spaces. We recall an algorithm for reducing the matrices…