Related papers: Elementary closed-forms for non-trivial divisors
For a finite set of non-zero natural numbers that contains at least one element different from 1 and the least common multiple of any of its subsets, there exists a subset of at least half of its members which has a common divisor larger…
Let $P$ be a non-torsion point on an elliptic curve defined over a number field $K$ and consider the sequence $\{B_n\}_{n\in \mathbb{N}}$ of the denominators of $x(nP)$. We prove that every term of the sequence of the $B_n$ has a primitive…
This work introduces the notion of unoperation $\mathfrak{Un}(\hat{O})$ of some operation $\hat{O}$. Given a valid output of $\hat{O}$, the corresponding unoperation produces a set of all valid inputs to $\hat{O}$ that produce the given…
In this article, we consider algebras $\mathcal{A}$ of non-formal pseudodifferential operators over $S^1$ which contain $C^\infty(S^1),$ understood as multiplication operators. We apply a construction of Chern-Weil type forms in order to…
We present the first fixed-length elementary closed-form expressions for the prime-counting function, $\pi(n)$, and the $n$-th prime number, $p(n)$. These expressions are arithmetic terms, requiring only a finite and fixed number of…
In this paper, we show how a construction of an implicit complexity model can be implemented using concepts coming from the core of von Neumann algebras. Namely, our aim is to gain an understanding of classical computation in terms of the…
Many conforming finite elements on squares and cubes are elegantly classified into families by the language of finite element exterior calculus and presented in the Periodic Table of the Finite Elements. Use of these elements varies, based…
We describe a simple method that produces automatically closed forms for the coefficients of continued fractions expansions of a large number of special functions. The function is specified by a non-linear differential equation and initial…
The purpose of the present work is to provide short and supple teaching notes for a $30$ hours introductory course on elementary \textit{Enumerative Algebraic Combinatorics}. We fully adopt the \textit{Rota way}. The themes are organized…
We present an explicit closed-form formula for the vertices of the classical cut polytope $\operatorname{CUT}(n)$, defined as the convex hull of cut vectors of the complete graph $K_n$. Our derivation proceeds via a related polytope,…
Symbolic Mathematical tasks such as integration often require multiple well-defined steps and understanding of sub-tasks to reach a solution. To understand Transformers' abilities in such tasks in a fine-grained manner, we deviate from…
The unit cost model is both convenient and largely realistic for describing integer decision algorithms over (+,*). Additional operations like division with remainder or bitwise conjunction, although equally supported by computing hardware,…
We present here a method which allows to derive a nontrivial lower bounds for the least common multiple of some finite sequences of integers. We obtain efficient lower bounds (which in a way are optimal) for the arithmetic progressions and…
Two problems are addressed: reduction of an arbitrary degree non-special divisor to the equivalent divisor of the degree equal to genus of a curve, and addition of divisors of arbitrary degrees. The hyperelliptic case is considered as the…
Inverse Vandermonde matrix calculation is a long-standing problem to solve nonsingular linear system $Vc=b$ where the rows of a square matrix $V$ are constructed by progression of the power polynomials. It has many applications in…
We derive closed-form expressions for several new classes of Hurwitzian- and Tasoevian continued fractions, including $[0;\overline{p-1,1,u(a+2nb)-1,p-1,1,v(a+(2n+1)b)-1 }\,\,]_{n=0}^\infty$, $[0; \overline{c + d m^{n}}]_{n=1}^{\infty}$ and…
We present an infinite family of identities that represent Ramanujan's tau function in terms of convolution sums of twisted divisor functions. Our method involves explicitly constructing non-vanishing level $1$ cusp forms from modular forms…
In this paper, we propose a primal-dual splitting algorithm for a broad class of structured composite monotone inclusions that involve finitely many set-valued operators, compositions of set-valued operators with bounded linear operators,…
We present a closed-form solution for n-th term of a general three-term recurrence relation with arbitrary given n-dependent coefficients. The derivation and corresponding proof are based on two approaches, which we develop and describe in…
The paper proposes an implicit (i.e., machine-independent) complexity approach to studying computation by polynomial-size, constant-depth circuits with gates counting modulo a constant through the lens of discrete ordinary differential…