Related papers: A family of formulas with reversal of arbitrarily …
We give a formula for the inverse matrix to an infinite matrix with possibly noncommutative entries, generalizing the Newton interpolation formula and the Taylor formula.
Turing's famous 'machine' framework provides an intuitively clear conception of 'computing with real numbers'. A recursive counterexample to a theorem shows that the theorem does not hold when restricted to computable objects. These…
Deterministic one-way time-bounded multi-counter automata are studied with respect to their ability to perform reversible computations, which means that the automata are also backward deterministic and, thus, are able to uniquely step the…
We obtain a description of the irreducible representation algebra of the alternating group of degree four over the ring of 2-adic integers.
We show that under the Bounded Proper Forcing Axiom and an anti-large cardinal assumption, there is a $\mathbf{\Pi}^1_2$ MAD family.
We classify order $3$ linear difference operators over $\mathbb{C}(x)$ that are solvable in terms of lower order difference operators. To prove this result, we introduce the notion of absolute irreducibility for difference modules, and…
It is shown that the formula for the variance of combined series yields surprisingly simple proofs of some well known variance bounds.
Using techniques from Poisson approximation, we prove explicit error bounds on the number of permutations that avoid any pattern. Most generally, we bound the total variation distance between the joint distribution of pattern occurrences…
Reversible forms of computations are often interesting from an energy efficiency point of view. When the computation device in question is an automaton, it is known that the minimal reversible automaton recognizing a given language is not…
In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…
The Eulerian triangle is a classical array of combinatorial numbers defined by a linear recursion. The associated boundary problem asks one to find all extreme nonnegative solutions to a dual recursion. Exploiting connections with random…
We classify the irreducible finite-dimensional representations of the twisted quantum affine algebras.
We study a certain family of infinite series with reciprocal Catalan numbers. We first evaluate two special candidates of the family in closed form, where we also present some Catalan-Fibonacci relations. Then we focus on the general…
This article surveys computational methods for posterior inference with intractable likelihoods, that is where the likelihood function is unavailable in closed form, or where evaluation of the likelihood is infeasible. We review recent…
In this article, we study (102,000)-avoiding inversion sequences with a fixed number of distinct elements. By introducing simple H-paths, we derive the trivariate generating function for these inversion sequences with respect to their…
We consider the enumeration of pattern-avoiding involutions, focusing in particular on sets defined by avoiding a single pattern of length 4. As we demonstrate, the numerical data for these problems demonstrates some surprising behavior.…
In this paper, we will show that the $p$-adic valuation (where $p$ is a given prime number) of some type of rational numbers is unusually large. This generalizes the very recent results by the author and by A. Dubickas, which are both…
There are infinite processes (matrix products, continued fractions, $(r,s)$-matrix continued fractions, recurrence sequences) which, under certain circumstances, do not converge but instead diverge in a very predictable way. We give a…
We present a simple formula for the expected number of inversions in a permutation of size $n$ obtained by applying $t$ random (not necessarily adjacent) transpositions to the identity permutation. More general, for any finite irreducible…
We perfect the recursion-transform method to be a complete theory, which can derive the general exact resistance between any two nodes in a resistor network with several arbitrary boundaries. As application of the method, we give a profound…