Related papers: Effective Computation of Generalized Abelian Compl…

The complexity of the equation solvability problem is known for nilpotent groups, for not solvable groups and for some semidirect products of Abelian groups. We provide a new polynomial time algorithm for deciding the equation solvability…

While efficient algorithms are known for solving many important problems related to groups, no efficient algorithm is known for determining whether two arbitrary groups are isomorphic. The particular case of 2-nilpotent groups, a special…

In this paper we describe an algorithm for the computation of canonical forms of finite subsets of $\mathbb{Z}^d$, up to affinities over $\mathbb{Z}$. For fixed dimension $d$, this algorithm has worst-case asymptotic complexity $O(n \log^2…

We study the problem of counting the total number of affine solutions of a system of n binomials in n variables over an algebraically closed field of characteristic zero. We show that we may decide in polynomial time if that number is…

We present a particularly nice Binet-style formula that can be used to produce the k-generalized Fibonacci numbers (that is, the Tribonaccis, Tetranaccis, etc). Furthermore, we show that in fact one needs only take the integer closest to…

The Tribonacci sequence $\mathbb{T}$ is the fixed point of the substitution $\sigma(a,b,c)=(ab,ac,a)$. In this note, we give the explicit expressions of the numbers of distinct squares and cubes in $\mathbb{T}[1,n]$ (the prefix of…

We deal with the algebraicity of an iterated Puiseux series in several variables in terms of the properties of its coefficients. Our aim is to generalize to several variables the results from [HM15]. We show that the algebraicity of such a…

For a fairly general class of two-dimensional tiling substitutions, we prove that if the length expansion $\beta$ is a Pisot number, then the tilings defined by the substitution must be locally finite. We also give a simple example of a…

We study Boolean circuits as a representation of Boolean functions and consider different equivalence, audit, and enumeration problems. For a number of restricted sets of gate types (bases) we obtain efficient algorithms, while for all…

In this note, we give the explicit formula for the number of multisubsets of a finite abelian group $G$ with any given size such that the sum is equal to a given element $g\in G$. This also gives the number of partitions of $g$ into a given…

We create a sequence version of calculus. First, we define equivalence, some fundamental operations, differential, and integral for sequences. Then, we propose sequence versions of identity function, power function, exponential function,…

Logic programming under the answer-set semantics nowadays deals with numerous different notions of program equivalence. This is due to the fact that equivalence for substitution (known as strong equivalence) and ordinary equivalence are…

We introduce and study a generalized Parikh matrix mapping based on tracking the occurrence counts of special types of subsequences. These matrices retain more information about a word than the original Parikh matrix mapping while…

In a Hamiltonian system with first class constraints observables can be defined as elements of a quotient Poisson bracket algebra. In the gauge fixing method observables form a quotient Dirac bracket algebra. We show that these two algebras…

In this paper, as an analogue of the integer case, we study detailedly the period and the rank of the generalized Fibonacci sequence of polynomials over a finite field modulo an arbitrary polynomial. We establish some formulas to compute…

A new notion of typicality for arbitrary probability measures on standard Borel spaces is proposed, which encompasses the classical notions of weak and strong typicality as special cases. Useful lemmas about strong typical sets, including…

Abelian periodicity of strings has been studied extensively over the last years. In 2006 Constantinescu and Ilie defined the abelian period of a string and several algorithms for the computation of all abelian periods of a string were…

The circuit equivalence problem of a finite algebra $\mathbf A$ is the computational problem of deciding whether two circuits over $\mathbf A$ define the same function or not. This problem not just generalises the equivalence problem for…

We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…

In this work, we introduce a family of new equivalence relations among fusion categories that are less refined than the usual Morita equivalence. We obtain abelian groups by quotienting these new equivalence relations from the commutative…