Related papers: Iterated Priority Arguments in Descriptive Set The…
This article aims to explain the Nested Benders algorithm for the solution of large-scale stochastic programming problems in a way that is intelligible to someone coming to it for the first time. In doing so it gives an explanation of…
We compare a relativistic and a nonrelativistic version of Ostrogradsky's method for higher-time derivative theories extended to scalar field theories and consider as an alternative a multi-field variant. We apply the schemes to space-time…
In this paper we provide an explicit connection between level-sets persistence and derived sheaf theory over the real line. In particular we construct a functor from 2-parameter persistence modules to sheaves over $\mathbb{R}$, as well as a…
The present work reviews the second half of Lyubarskii and Seip's paper, Weighted Paley--Wiener Spaces. Axioms defining a larger class of de Branges spaces are abstracted, allowing us to state and prove their results at a higher level of…
We show how machine learning methods can unveil the fractional and delayed nature of discrete dynamical systems. In particular, we study the case of the fractional delayed logistic map. We show that given a trajectory, we can detect if it…
We study the algebra of functions on the Iwahori group via the category of graded bounded representations of its Lie algebra. In particular, we identify the standard and costandard objects in this category with certain generalized Weyl…
In a recent article, we introduced and studied a precise class of dynamical systems called solvable systems. These systems present a dynamic ruled by discontinuous ordinary differential equations with solvable right-hand terms and unique…
A system of linear dependent types for the lambda calculus with full higher-order recursion, called dlPCF, is introduced and proved sound and relatively complete. Completeness holds in a strong sense: dlPCF is not only able to precisely…
There exist excellent codes for an efficient numerical treatment of stiff and differential-algebraic problems. Let us mention {\sc Radau5} which is based on the $3$-stage Radau IIA collocation method, and its extension to problems with…
In this paper we introduce a new ingredient, invariant systems of differential equations, to our study of character sheaves on graded Lie algebras. The character sheaves we construct in this paper, together with the ones constructed in…
In this paper we study linearly repetitive Delone sets and prove, following the work of Bellissard, Benedetti and Gambaudo, that the hull of a linearly repetitive Delone set admits a properly nested sequence of box decompositions (tower…
Many problems can be specified by patterns of propositional formulae depending on a parameter, e.g. the specification of a circuit usually depends on the number of bits of its input. We define a logic whose formulae, called "iterated…
Necessary and sufficient conditions for the exponentiation of finite-dimensional real Lie algebras of linear operators on complete Hausdorff locally convex spaces are obtained, focused on the equicontinuous case - in particular, necessary…
In this work, we report a stable ordered structure -- the cubic FDDD phase -- that has not previously been identified in the Landau-Brazovskii (LB) model, a fundamental and important model for studying crystals and their phase transitions.…
In this note, we propose a method to under-approximate finite-time reachable sets and tubes for a class of continuous-time linear uncertain systems. The class under consideration is the linear time-varying (LTV) class with integrable…
Let \Gamma be a geometrically finite tree lattice. We prove a Khintchine-Sullivan type theorem for the Hausdorff measure of the points at infinity of the tree that are well approximated by the parabolic fixed points of G. Using Bruhat-Tits…
We define and study an effective version of the Wadge hierarchy in computable quasi-Polish spaces which include most spaces of interest for computable analysis. Along with hierarchies of sets we study hierarchies of k-partitions which are…
Differentiable logics are a family of quantitative logics originated in the machine learning literature. Because of their origin, differentiable logics often come equipped with analytic properties that guarantee that they are…
We provide a simple proof of a computable analogue to the Jayne Rogers Theorem from descriptive set theory. The difficulty of the proof is delegated to a simulation result pertaining to non-deterministic type-2 machines. Thus, we…
We show that the statement ``In every separable pseudometric space there is a maximal non-strictly \delta-separated set.'' implies the axiom of choice for countable families of sets. This gives answers to a question of Dybowski and…