Related papers: A Note on Shortest Developments
We investigate the theory of finite observables, i.e., resolutions of the finite-dimensional identity by means of positive operators, that have a physical interpretation in terms of measurement schemes. We focus on extremal and rank-one…
A linear forest is a collection of vertex-disjoint paths. The Linear Arboricity Conjecture states that every graph of maximum degree $\Delta$ can be decomposed into at most $\lceil(\Delta+1)/2\rceil$ linear forests. We prove that $\Delta/2…
We prove that persistently finite algebras are not created by completions of algebras, in any ordered discriminator variety. A persistently finite algebra is one without infinite simple extensions. We prove that finite measurable relation…
In this short note, we give two proofs of the infinitude of primes via valuation theory and give a new proof of the divergence of the sum of prime reciprocals by Roth's theorem and Euler-Legendre's theorem for arithmetic progressions.
The study of convex functions - in particular, of their optimization (really minimization) is one of the most important fields of applied mathematics. Convexity seems to be one of those incredibly well-chosen hypotheses which is just…
We introduce discretizations of infinite-dimensional optimization problems with total variation regularization and integrality constraints on the optimization variables. We advance the discretization of the dual formulation of the total…
G\"odel's first and second incompleteness theorems are corner stones of modern mathematics. In this article we present a new proof of these theorems for ZFC and theories containing ZFC, using Chaitin's incompleteness theorem and a very…
Finite-dimensional linear programs satisfy strong duality (SD) and have the "dual pricing" (DP) property. The (DP) property ensures that, given a sufficiently small perturbation of the right-hand-side vector, there exists a dual solution…
We give the first almost-linear total time algorithm for deciding if a flow of cost at most $F$ still exists in a directed graph, with edge costs and capacities, undergoing decremental updates, i.e., edge deletions, capacity decreases, and…
Recently, a vector version of Witsenhausen's counterexample was considered and it was shown that in that limit of infinite vector length, certain quantization-based control strategies are provably within a constant factor of the optimal…
We establish limit theorems involving weak convergence of multiple generations of critical and supercritical branching processes. These results arise naturally when dealing with the joint asymptotic behavior of functionals defined in terms…
This paper demonstrates a practical method for computing the solution of an expectation-constrained robust maximization problem with immediate applications to model-free no-arbitrage bounds and super-replication values for many financial…
We present in this paper a first-order axiomatization of an extended theory $T$ of finite or infinite trees, built on a signature containing an infinite set of function symbols and a relation $\fini(t)$ which enables to distinguish between…
We study reductions that limit the extreme adaptivity of Turing reductions. In particular, we study reductions that make a rapid, structured progression through the set to which they are reducing: Each query is strictly longer (shorter)…
We consider nonlinear delay differential and renewal equations with infinite delay. We extend the work of Gyllenberg et al, Appl. Math. Comput. (2018) by introducing a unifying abstract framework, and derive a finite-dimensional…
Classical existence theorems and solution methods for quadratic programming traditionally rely on the analytical properties of real numbers, specifically compactness and completeness. These tools are unavailable in general linearly ordered…
We revisit the well-known Curve Shortening Flow for immersed curves in the $d$-dimensional Euclidean space. We exploit a fundamental structure of the problem to derive a new global construction of a solution, that is, a construction that is…
All known structural extensions of the substructural logic $\mathsf{FL_e}$, Full Lambek calculus with exchange/commutativity, (corresponding to subvarieties of commutative residuated lattices axiomatized by $\{\vee, \cdot, 1\}$-equations)…
In two dimensions every weak solution to a nonlinear elliptic system $\rm{div} a(x,u,Du)=0$ has H\"older continuous first derivatives provided that standard continuity, ellipticity and growth assumptions hold with a growth exponent $p \geq…
The electromagnetic two-body problem has \emph{neutral differential delay} equations of motion that, for generic boundary data, can have solutions with \emph{discontinuous} derivatives. If one wants to use these neutral differential delay…