Related papers: Reverse Mathematical Bounds for the Termination Th…
We explore the Collatz conjecture and its variants through the lens of termination of string rewriting. We construct a rewriting system that simulates the iterated application of the Collatz function on strings corresponding to mixed…
Rewriting is a framework for reasoning about functional programming. The dependency pair criterion is a well-known mechanism to analyze termination of term rewriting systems. Functional specifications with an operational semantics based on…
Cut-elimination is the bedrock of proof theory with a multitude of applications from computational interpretations to proof analysis. It is also the starting point for important meta-theoretical investigations including decidability,…
Let $M$ be a complete Riemannian manifold satisfying the doubling volume condition for geodesic balls and $L^q$ scaled Poincar\'e inequalities on suitable remote balls for some $q<2$. We prove the inequality $\left\Vert…
We present an extensive analysis of relative deviation bounds, including detailed proofs of two-sided inequalities and their implications. We also give detailed proofs of two-sided generalization bounds that hold in the general case of…
We expose in full detail a constructive procedure to invert the so--called "finite Markov moment problem". The proofs rely on the general theory of Toeplitz matrices together with the classical Newton's relations.
We investigate infinite sets that witness the failure of certain Ramsey-theoretic statements, such as Ramsey's or (appropriately phrased) Hindman's theorem; such sets may exist if one does not assume the Axiom of Choice. We obtain very…
In 2005, Rampersad and the second author proved a number of theorems about infinite words x with the property that if w is any sufficiently long finite factor of x, then its reversal w^R is not a factor of x. In this note we revisit these…
The drawbacks in the formulations of random infinite divisibility in Sandhya (1991, 1996), Gnedenko and Korelev (1996), Klebanov and Rachev (1996), Bunge (1996) and Kozubowski and Panorska (1996) are pointed out. For any given Laplace…
The problem of determining whether a probabilistic program terminates almost surely (i.e.~with probability one) is undecidable, and actually $\Pi^0_2$-complete. For this reason, a growing literature has explored classes of programs for…
We study the representation theory of the algebraic Toeplitz algebra $R={\mathbb K}\langle x,y\rangle/\langle xy-1\rangle$, give a few new structure and homological theorems, completely determine one-sided ideals and survey and re-obtain…
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…
In 2012 M. Soki\'c proved that the class of all finite permutations has the Ramsey property. Using different strategies the same result was then reproved in 2013 by J. B\"ottcher and J. Foniok, in 2014 by M. Bodirsky and in 2015 yet another…
Recently we generalized Toponogov's comparison theorem to a complete Riemannian manifold with smooth convex boundary, where a geodesic triangle was replaced by an open (geodesic) triangle standing on the boundary of the manifold, and a…
Using the tools of reverse mathematics in second-order arithmetic, as developed by Friedman, Simpson, and others, we determine the axioms necessary to develop various topics in commutative ring theory. Our main contributions to the field…
Almost from the inception of Hilbert's program, foundational and structural efforts in proof theory have been directed towards the goal of clarifying the computational content of modern mathematical methods. This essay surveys various…
Ritt's theorem of zeroes and Seidenberg's embedding theorem are classical results in differential algebra allowing to connect algebraic and model-theoretic results on nonlinear PDEs to the realm of analysis. However, the existing proofs of…
Recently, Solecki introduced the notion of Ramsey monoid to produce a common generalization to theorems such as Hindman's theorem, Carlson's theorem, and Gowers' FIN$_k$ theorem. He proved that an entire class of finite monoids is Ramsey.…
The explicit expressions for the strong and the weak rigorous multiplicative perturbation bounds for the Generalized block Cholesky downdating problem are obtained. By bringing together the modified matrix-vector equation approach with the…
Contraction analysis uses a local criterion to prove the long-term behaviour of a dynamical system. A contraction metric is a Riemannian metric with respect to which the distance between adjacent solutions contracts. If adjacent solutions…