Related papers: Fast Ramanujan-type Series for Logarithms. Part I

Orthogonal systems in $\mathrm{L}_2(\mathbb{R})$, once implemented in spectral methods, enjoy a number of important advantages if their differentiation matrix is skew-symmetric and highly structured. Such systems, where the differentiation…

Computing the LZ factorization (or LZ77 parsing) of a string is a computational bottleneck in many diverse applications, including data compression, text indexing, and pattern discovery. We describe new linear time LZ factorization…

Difficulty of calculation of discrete logarithm for any arbitrary Field is the basis for security of several popular cryptographic solutions. Pohlig-Hellman method is a popular choice to calculate discrete logarithm in finite field $F_p^*$.…

Wilf-Zeilberger pairs are fundamental in the algorithmic theory of Wilf and Zeilberger for computer-generated proofs of combinatorial identities. Wilf-Zeilberger forms are their high-dimensional generalizations, which can be used for…

The known WZ-proofs for Ramanujan-type series related to $1/\pi$ gave us the insight to develop a new proof strategy based on the WZ-method. Using this approach we are able to find more generalizations and discover first WZ-proofs for…

We propose efficient algorithms with logarithmic step complexities for the generation of entangled $GHZ_N$ and $W_N$ states useful for quantum networks, and we demonstrate an implementation on the IBM quantum computer up to $N=16$. Improved…

We explore the innovative use of MLP-Mixer models for real-time jet tagging and establish their feasibility on resource-constrained hardware like FPGAs. MLP-Mixers excel in processing sequences of jet constituents, achieving…

We report major advances in the research program initiated in "Moment-Based Evidence for Simple Rational-Valued Hilbert-Schmidt Generic 2 x 2 Separability Probabilities" (J. Phys. A, 45, 095305 [2012]). A highly succinct separability…

Fast-rate models are essential for control design, specifically to address intersample behavior. The aim of this paper is to develop a frequency-domain non-parametric identification technique to estimate fast-rate models of systems that…

Integer linear programming (ILP) models a wide range of practical combinatorial optimization problems and significantly impacts industry and management sectors. This work proposes new characterizations of ILP with the concept of boundary…

This paper proposes a new signature scheme based on two hard problems : the cube root extraction modulo a composite moduli (which is equivalent to the factorisation of the moduli, IFP) and the discrete logarithm problem(DLP). By combining…

We use visible point vector identities to examine polylogarithms in the neighbourhood of the Riemann zeta function zeroes. New formulas limiting to the trivial zeroes and to the critical line on the zeta function are given. Similar results…

We derive a set of polynomial and quasipolynomial identities for degrees of syzygies in the Hilbert series H(d^m;z) of nonsymmetric numerical semigroups S(d^m) of arbitrary generating set of positive integers d^m={d_1,...,d_m}, m\geq 3.…

We present a new algorithm for computing the Lempel-Ziv Factorization (LZ77) of a given string of length $N$ in linear time, that utilizes only $N\log N + O(1)$ bits of working space, i.e., a single integer array, for constant size integer…

We present a systematic method for proving nonterminating basic hypergeometric identities. Assume that $k$ is the summation index. By setting a parameter $x$ to $xq^n$, we may find a recurrence relation of the summation by using the…

It is only in exceptional cases that a $_2F_1(z)$-series with rational parameters and a rational argument, apart from the cases for $z \in \{ \pm 1, \frac{1}{2} \}$ associated with classical hypergeometric identities, admits an evaluation…

For a finite $\mathbb{Z}$-algebra $R$, i.e., for a $\mathbb{Z}$-algebra which is a finitely generated $\mathbb{Z}$-module, we assume that $R$ is explicitly given by a system of $\mathbb{Z}$-module generators $G$, its relation module ${\rm…

We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; indefinite and definite summation of sequences that are…

We establish some new bilateral double-sum Rogers-Ramanujan identities involving parameters. As applications, these identities yield several new multi-sum Rogers-Ramanujan type identities. Our proofs utilize the theory of basic…

This paper considers the identification of large-scale 1D networks consisting of identical LTI dynamical systems. A new subspace identification method is developed that only uses local input-output information and does not rely on knowledge…