Related papers: Iterated multiplication in $VTC^0$
This paper is the continuation of \cite{htl}, where we deal with Lucas sequences. Here we study integers represented by integer sequences which satisfy binary recursive relations. In case of non-degenerate sequences we give bounds for the…
One proves that each almost local-global semihereditary ring has the stacked basis property and is almost Bezout. If M is a finitely presented module, its torsion part tM is a direct sum of cyclic modules where the family of annhilators is…
We extend the study of \emph{melonic} quartic tensor models to models with arbitrary quartic interactions. This extension requires a new version of the loop vertex expansion using several species of intermediate fields and iterated…
Using the action of the Galois group of a normal extension of number fields, we generalize and symmetrize various fundamental statements in algebra and algebraic number theory concerning splitting types of prime ideals, factorization types…
This paper is concerned with the automated complexity analysis of term rewrite systems (TRSs for short) and the ramification of these in implicit computational complexity theory (ICC for short). We introduce a novel path order with multiset…
We present and analyze a natural hierarchy of weak theories, develop analysis in them, and show that they are interpretable in bounded quantifier arithmetic $\text{I}\Delta_0$ (and hence in Robinson arithmetic Q). The strongest theories…
In a previous paper we produced a complex iteration of a holomorphic function $\phi$ in the immediate basin of a fixed point whose multiplier is a real number and in between zero and one. We further explore this problem, allowing the…
Category theory is famous for its innovative way of thinking of concepts by their descriptions, in particular by establishing universal properties. Concepts that can be characterized in a universal way receive a certain quality seal, which…
Let $t(n)$ denote the number of $1$-bits in the base-$2$ representation of $n$, taken modulo $2$. We show how to prove the classic conjecture of Leo Moser, on the rarefied sum $\sum_{0\leq i<n} (-1)^{t(3i)}$, using tools from automata…
In a variety of studies of dynamical systems, the edge of order and chaos has been singled out as a region of complexity. It was suggested by Wolfram, on the basis of qualitative behaviour of cellular automata, that the computational basis…
An analytical-numeric calculation method of extremely complicated integrals is presented. These integrals appear often in magnet soliton theory. The appropriate analytical continuation and a corresponding integration contour allow to reduce…
The circular law asserts that if $X_n$ is a $n \times n$ matrix with iid complex entries of mean zero and unit variance, then the empirical spectral distribution of $\frac{1}{\sqrt{n}} X_n$ converges almost surely to the uniform…
We present a novel set of reversible modular multipliers applicable to quantum computing, derived from three classical techniques: 1) traditional integer division, 2) Montgomery residue arithmetic, and 3) Barrett reduction. Each multiplier…
An ideal is a nonempty collection of subsets closed under heredity and finite additivity. The aim of this paper is to unify some weak separation properties via topological ideals. We concentrate our attention on the separation axioms…
We obtain a Bloom-type characterization of the two-weighted boundedness of iterated commutators of singular integrals. The necessity is established for a rather wide class of operators, providing a new result even in the unweighted setting…
The problem of iterated partial summations is solved for some discrete distributions defined on discrete supports. The power method, usually used as a computational approach to finding matrix eigenvalues and eigenvectors, is in some cases…
In recent years, a large class of nuclear $C^\ast$-algebras have been classified, modulo an assumption on the Universal Coefficient Theorem (UCT). We think this assumption is redundant and propose a strategy for proving it. Indeed,…
We provide a complete axiomatization of modal inclusion logic - team-based modal logic extended with inclusion atoms. We review and refine an expressive completeness and normal form theorem for the logic, define a natural deduction proof…
Based on the pioneering ideas of Kashaev [Kas98,Kas00], we present a fully explicit construction of a finite-dimensional projective representation of the dotted Ptolemy groupoid when the quantum parameter $q$ is a root of unity, which…
We propose a generic algorithm for computing the inverses of a multiplicative function under the assumption that the set of inverses is finite. More generally, our algorithm can compute certain functions of the inverses, such as their power…