Related papers: Modular Arithmetic Study on Ascending and Descendi…
These notes focus on the minimization of convex functionals using first-order optimization methods, which are fundamental in many areas of applied mathematics and engineering. The primary goal of this document is to introduce and analyze…
Integer partitions may be encoded as either ascending or descending compositions for the purposes of systematic generation. Many algorithms exist to generate all descending compositions, yet none have previously been published to generate…
We study the reduction in a lambda-calculus derived from Moggi's computational one, that we call the computational core. The reduction relation consists of rules obtained by orienting three monadic laws. Such laws, in particular…
Adversarial computations are a widely studied class of computations where resource-bounded probabilistic adversaries have access to oracles, i.e., probabilistic procedures with private state. These computations arise routinely in several…
The infamous 3x+1 conjecture spread by Lothar Collatz in 1952, despite its elementary formulation, remained unproved for over 60 years. From the heuristical probabilistic approach to the complex mapping of the algorithm, the scientific…
We study the joint distribution of descents and inverse descents over the set of permutations of n letters. Gessel conjectured that the two-variable generating function of this distribution can be expanded in a given basis with nonnegative…
This article introduces a new kind of number systems on $p$-adic integers which is inspired by the well-known $3n+1$ conjecture of Lothar Collatz. A $p$-adic system is a piecewise function on $\mathbb{Z}_p$ which has branches for all…
The scope of the present work is to explain why it is true that all N have a distinct position in The Collatz Tree (The Collatz Graph)
This note concerns bounded derivations on maximal triangular operator algebras on a Hilbert space. Given any bounded derivation $\delta$ on a maximal triangular algebra whose invariant lattice is continuous at 1, an operator which is shown…
Exploiting higher-order derivatives in convex optimization is known at least since 1970's. In each iteration higher-order (also called tensor) methods minimize a regularized Taylor expansion of the objective function, which leads to faster…
We study a class of maps having the Collatz function (famously related to the Collatz Conjecture) as an example, under the topological and ergodic perspectives, including an approach with thermodynamic formalism. By introducing a key…
In the Collatz 3x+1 problem, there are 3 possibilities: Starting from any positive number, we either reach the trivial loop (1,4,2), end up in a non-trivial loop, or go until infinity. In this paper, we shall show that if a non-trivial loop…
Motivated by numerous examples in the literature, we state a conjecture on the Hilbert series of Koszul symmetric operads generated by one element of arity $2$. We prove this conjecture for all Koszul symmetric set-operads generated by one…
We apply operad theory to enumerative combinatorics in order to count the number of shuffles between series-parallel posets and chains. We work with three types of shuffles, two of them noncommutative, for example a left deck-divider…
Answering a question of Donald Knuth, we find the bivariate exponential generating function for "up-up-or-down-down'' permutations of odd length according to their last entry. An up-up-or-down-down permutation is a permutation $a_1a_2\cdots…
Monads are of interest both in semantics and in higher dimensional algebra. It turns out that the idea behind usual notion finitary monads (whose values on all sets can be computed from their values on finite sets) extends to a more general…
Causality serves as an abstract notion of time for concurrent systems. A computation is causal, or simply valid, if each observation of a computation event is preceded by the observation of its causes. The present work establishes that this…
We analyze Coquand's game-theoretic interpretation of Peano Arithmetic through the lens of elementary descent recursion. In Coquand's game semantics, winning strategies correspond to infinitary cut-free proofs and cut elimination…
This paper presents some considerations about the Goldbach's conjecture (GC). The work is based on elementary results of the number theory and it provides a constructive method that permits, given an even integer, to find at least a pair of…
We give a short proof of Belaga's result on bounds to perigees of $(3x+d)$-cycles of a given oddlength. We also reformulate the Collatz cycle conjecture which is rather a algorithmic problem into a purely arithmetic problem.