Related papers: Efficient Methods in Counting Generalized Necklace…

Uniformly for small $q$ and $(a,q)=1$, we obtain an estimate for the weighted number of ways a sufficiently large integer can be represented as the sum of a prime congruent to $a$ modulo $q$ and a square-free integer. Our method is based on…

Legendre discovered that the continued fraction expansion of $\sqrt N$ having odd period leads directly to an explicit representation of $N$ as the sum of two squares. In this vein, it was recently observed that the continued fraction…

For a set $M$ of $m$ elements, we define a decreasing chain of classes of normalized monotone-increasing valuation functions from $2^M$ to $\mathbb{R}_{\geq 0}$, parameterized by an integer $q \in [2,m]$. For a given $q$, we refer to the…

The $q$-commutation relations, formulated in the setting of the $q$-Fock space of Bo\.zjeko and Speicher, interpolate between the classical commutation relations (CCR) and the classical anti-commutation relations (CAR) defined on the…

Jordan Normal Forms serve as excellent representatives of conjugacy classes of matrices over closed fields. Once we knows normal forms, we can compute functions of matrices, their main invariant, etc. The situation is much more complicated…

For an integer $c\geq 1$, let $a_c(n)$ count the number of generalized cubic partitions of $n$, which are partitions of $n$ whose even parts may appear in $c$ different colors, and $d_c(n)$ count the number of partitions obtained by adding…

Let $\boldsymbol{\alpha}\in \mathbb{R}^N$ and $Q\geq 1$. We consider the sum $\sum_{\boldsymbol{q}\in [-Q,Q]^N\cap\mathbb{Z}^N\backslash\{\boldsymbol{0}\}}\|\boldsymbol{\alpha}\cdot\boldsymbol{q}\|^{-1}$. Sharp upper bounds are known when…

A circular word, or a necklace, is an equivalence class under conjugation of a word. A fundamental question concerning regularities in standard words is bounding the number of distinct squares in a word of length $n$. The famous conjecture…

In recent three--loop calculations of massive Feynman integrals within Quantum Chromodynamics (QCD) and, e.g., in recent combinatorial problems the so-called generalized harmonic sums (in short $S$-sums) arise. They are characterized by…

This paper addresses new results on the factorization of the general Heun's operator, extending the investigations performed in previous works [{\it Applied Mathematics and Computation} {\bf 141} (2003), 177 - 184 and {\bf 189} (2007), 816…

We construct an algorithm that reduces the complexity for computing generalized Dedekind sums from exponential to polynomial time. We do so by using an efficient word rewriting process in group theory.

The intuitionistic fragment of the call-by-name version of Curien and Herbelin's \lambda\_mu\_{\~mu}-calculus is isolated and proved strongly normalising by means of an embedding into the simply-typed lambda-calculus. Our embedding is a…

Let $m_{\lambda }$ be the monomial symmetric functions, $ \lambda $ being an integer partition of $n\in \mathbb{N}^{\ast }$. For the specialization corresponding to the $q$-deformation of the exponential, we prove that each $m_{\lambda }$…

Since their introduction by Andrews, generalized Frobenius partitions have interested a number of authors, many of whom have worked out explicit formulas for their generating functions in specific cases. This has uncovered interesting…

Contrary to several other families of lambda terms, no closed formula or generating function is known and none of the sophisticated techniques devised in analytic combinatorics can currently help with counting or generating the set of {\em…

One of the crucial generic techniques for quantum computation is amplitude encoding. Although several approaches have been proposed, each of them often requires exponential classical-computational cost or an oracle whose explicit…

We investigate arithmetic properties of values of the entire function $$ F(z)=F_q(z;\lambda)=\sum_{n=0}^\infty\frac{z^n}{\prod_{j=1}^n(q^j-\lambda)}, \qquad |q|>1, \quad \lambda\notin q^{\mathbb Z_{>0}}, $$ that includes as special cases…

Generalized bent (gbent) functions is a class of functions $f: \mathbb{Z}_2^n \rightarrow \mathbb{Z}_q$, where $q \geq 2$ is a positive integer, that generalizes a concept of classical bent functions through their co-domain extension. A lot…

We deal with the fragment of modal logic consisting of implications of formulas built up from the variables and the constant `true' by conjunction and diamonds only. The weaker language allows one to interpret the diamonds as the uniform…

Quantification, i.e., the task of training predictors of the class prevalence values in sets of unlabeled data items, has received increased attention in recent years. However, most quantification research has concentrated on developing…