Related papers: The M\"obius Function of Generalized Factor Order
This paper analyzes the M\"obius ($\mu(i)$) function defined on the partially ordered set of triangular numbers ($\mathcal T(i)$) under the divisibility relation. We make conjectures on the asymptotic behavior of the classical M\"obius and…
The generalized composition graph is used by Cardoso and some researchers for factorization of the adjacency spectrum and Laplacian of a simple graph. Because the generalized composition graph is an example of a set-theoretic linear operad,…
The concept of fractional order derivative can be found in extensive range of many different subject areas. For this reason, the concept of fractional order derivative should be examined. After giving different methods mostly used in…
Inspired by the works of Forman on discrete Morse theory, which is a combinatorial adaptation to cell complexes of classical Morse theory on manifolds, we introduce a discrete analogue of the stratified Morse theory of Goresky and…
We solve the boson normal ordering problem for F[(a*)^r a^s], with r,s positive integers, where a* and a are boson creation and annihilation operators satisfying [a,a*]=1. That is, we provide exact and explicit expressions for the normal…
Let A be an alphabet and let F be a set of words with letters in A. We show that the sum of all words with letters in A with no consecutive subwords in F, as a formal power series in noncommuting variables, is the reciprocal of a series…
For any function F(x) having a Taylor expansion we solve the boson normal ordering problem for F[(a*)^r a^s], with r,s positive integers,[a,a*]=1, i.e. we provide exact and explicit expressions for its normal form which has all a's to the…
A well-ordering principle is a principle of the form: If $X$ is well-ordered then $F(X)$ is well-ordered, where $F$ is some natural operator transforming linear orders into linear orders. Many important subsystems of Second-order Arithmetic…
A generalized criterion for signature related algorithms to compute Gr\"obner basis is proposed in this paper. Signature related algorithms are a popular kind of algorithms for computing Gr\"obner basis, including the famous F5 algorithm,…
Higher-order unification has been shown to be undecidable. Miller discovered the pattern fragment and subsequently showed that higher-order pattern unification is decidable and has most general unifiers. We extend the algorithm to…
We relate the computational complexity of finite strings to universal representations of their underlying symmetries. First, Boolean functions are classified using the universal covering topologies of the circuits which enumerate them. A…
In this paper we give a generalization of Chebyshev polynomials and using this we describe the M\"obius function of the generalized subword order from a poset {a1,...as,c |ai<c}, which contains an affirmative answer for the conjecture by…
We combine the language of monoids with the language of preorders so as to refine some fundamental aspects of the classical theory of factorization and prove an abstract factorization theorem with a variety of applications. In particular,…
In this paper, we study the generalized gapped k-mer filters and derive a closed form solution for their coefficients. We consider nonnegative integers $\ell$ and $k$, with $k\leq \ell$, and an $\ell$-tuple $B=(b_1,\ldots,b_{\ell})$ of…
For the first time, a general fractional calculus of arbitrary order was proposed by Yuri Luchko in the works Mathematics 9(6) (2021) 594 and Symmetry 13(5) (2021) 755. In these works, the proposed approaches to formulate this calculus are…
The $F$-triangle is a refined face count for the generalised cluster complex of Fomin and Reading. We compute the $F$-triangle explicitly for all irreducible finite root systems. Furthermore, we use these results to partially prove the…
A necessary and sufficient condition is provided for the solvability of a binomial congruence with a composite modulus, circumventing its prime factorization. This is a generalization of Euler's Criterion through that of Euler's Theorem,…
Originally motivated by questions of P. Etingof related to growth rates of tensor powers in symmetric tensor categories, we obtain general bounds on the order of finite subgroups of ${\rm GL}(n,\mathbb{C})$ with restricted composition…
It is a classical theorem that the free product of ordered groups is orderable. In this note we show that, using a method of G. Bergman, an ordering of the free product can be constructed in a functorial manner, in the category of ordered…
We provide the solution to the normal ordering problem for powers and exponentials of two classes of operators. The first one consists of boson strings and more generally homogeneous polynomials, while the second one treats operators linear…