Related papers: Techniques for approaching the dual Ramsey propert…
We show that several classical Ramseyan statements, and a forcing statement, are each equivalent to having Rothberger's property in all finite powers.
We prove a canonization result for the Carlson-Simpson forcing in the spirit of \cite{KSZ}. We generalize the weak form of the Carlson-Simpson theorem (\cite{CaSi}) dealing with partitions without free blocks: instead of dealing with finite…
The role of projectors associated with Poisson brackets of constrained Hamiltonian systems is analyzed. Projectors act in two instances in a bracket: in the explicit dependence on the variables and in the computation of the functional…
State-of-the-art techniques for simultaneous localization and mapping (SLAM) employ iterative nonlinear optimization methods to compute an estimate for robot poses. While these techniques often work well in practice, they do not provide…
This paper introduces the concept of a productive notion of big Ramsey degree and showcases its versatility through a handful of applications. The main focus is notably providing sufficient conditions for the existence of a finite canonical…
Gauging and duality transformations, two of the most useful tools in many-body physics, are shown to be equivalent up to constant depth quantum circuits in the case of one-dimensional quantum lattice models. This is demonstrated by making…
Two-sided bounds for the efficiency of the torsion function are obtained in terms of the square of the distance to the boundary function under the hypothesis that the Dirichlet Laplacian satisfies a strong Hardy inequality. Localisation…
Parsimony, including sparsity and low rank, has been shown to successfully model data in numerous machine learning and signal processing tasks. Traditionally, such modeling approaches rely on an iterative algorithm that minimizes an…
Ramsey theory is the study of conditions under which mathematical objects show order when partitioned. Ramsey theory on the integers concerns itself with partitions of $[1,n]$ into $r$ subsets and asks the question whether one (or more) of…
Induction is the process by which we obtain predictive laws or theories or models of the world. We consider the structural aspect of induction. We answer the question as to whether we can find a finite and minmalistic set of operations on…
Functions in Hardy spaces on multiply-connected domains in the plane are given an explicit characterization in terms of a boundary condition inspired by the two-dimensional Ising model. The key underlying property is the positivity of a…
Deep learning models for semantics are generally evaluated using naturalistic corpora. Adversarial methods, in which models are evaluated on new examples with known semantic properties, have begun to reveal that good performance at these…
We introduce an algorithm to piecewise dualise linear quivers into their mirror dual. The algorithm uses two basic duality moves and the properties of the $S$-wall which can all be derived by iterative applications of Seiberg-like…
Propounding a general categorical framework for the extension of dualities, we present a new proof of the de Vries Duality Theorem for the category $\bf KHaus$ of compact Hausdorff spaces and their continuous maps, as an extension of a…
We introduce a theory of multigraded Cayley-Chow forms associated to subvarieties of products of projective spaces. Two new phenomena arise: first, the construction turns out to require certain inequalities on the dimensions of projections;…
We first present a Priestley-style dualitiy for the classes of algebras that are the algebraic counterpart of some congruential, finitary and filter-distributive logic with theorems. Then we analyze which properties of the dual spaces…
We investigate (pseudo)differential forms in the framework of supergeometry. Definitions, basic properties and Cartan calculus (DeRham differential, Lie derivative, inner product, Hodge operator) are presented; the symplectic supermechanics…
We discuss various dualities, relating integrable systems and show that these dualities are explained in the framework of Hamiltonian and Poisson reductions. The dualities we study shed some light on the known integrable systems as well as…
In quantum logical terms, Hardy-type arguments can be uniformly presented and extended as collections of intertwined contexts and their observables. If interpreted classically those structures serve as graph-theoretic "gadgets" that enforce…
The theory of finite term algebras provides a natural framework to describe the semantics of functional languages. The ability to efficiently reason about term algebras is essential to automate program analysis and verification for…