English
Related papers

Related papers: A universality theorem for allowable sequences wit…

200 papers

<p>We address the general problem of determining the validity of boolean combinations of equalities and inequalities between real-valued expressions. In particular, we consider methods of establishing such assertions using only restricted…

Logic in Computer Science · Computer Science 2017-01-11 Jeremy Avigad , Harvey Friedman

A fairly general continuation theorem of Leray-Schauder type for the class of so-called admissible multimaps is set forth. This result is then used to establish a universal rule for solving operator inclusions of Hammerstein type in…

Functional Analysis · Mathematics 2019-03-20 Radosław Pietkun

We relate the existence problem of universal objects to the properties of corresponding enriched categories (lifts or expansions). In particular, extending earlier results, we prove that for every (possibly infinite) regular set F of finite…

Combinatorics · Mathematics 2013-03-05 Jan Hubička , Jaroslav Nešetřil

Perfect ideals $I$ of grade $3$ in a local ring $(R,\mathfrak{m},\Bbbk)$ can be classified based on multiplicative structures on $\text{Tor}^R_{\bullet}(R/I,\Bbbk)$. The classification is incomplete in the sense that it remains open which…

Commutative Algebra · Mathematics 2025-07-25 Alexis Hardesty

We study shallow and deep neural networks whose inputs range over a general topological space. The model is built from a prescribed family of continuous feature maps and reduces to multilayer feedforward networks in the Euclidean case. We…

General Topology · Mathematics 2026-03-24 Vugar Ismailov

We show that the essentially algebraic theory of generalized algebraic theories, regarded as a category with finite limits, has a universal exponentiable arrow in the sense that any exponentiable arrow in any category with finite limits is…

Category Theory · Mathematics 2022-05-03 Taichi Uemura

We synthesize and unify notions of regularity, both of individual sets and of collections of sets, as they appear in the convergence theory of projection methods for consistent feasibility problems. Several new characterizations of…

Optimization and Control · Mathematics 2018-05-15 Alexander Y. Kruger , D. Russell Luke , Nguyen H. Thao

Necessary and sufficient conditions are presented for the (first-order) theory of a universal class of algebraic structures (algebras) to admit a model completion, extending a characterization provided by Wheeler. For varieties of algebras…

Logic · Mathematics 2022-01-05 George Metcalfe , Luca Reggio

We show that the decision problem of determining whether a given (abstract simplicial) $k$-complex has a geometric embedding in $\mathbb R^d$ is complete for the Existential Theory of the Reals for all $d\geq 3$ and $k\in\{d-1,d\}$. This…

Computational Complexity · Computer Science 2021-11-08 Mikkel Abrahamsen , Linda Kleist , Tillmann Miltzow

Given a category of objects, it is both useful and important to know if all the objects in the category may be realised as sub-objects -- via morphisms in the given category -- of a single object in that category enjoying some nice…

Functional Analysis · Mathematics 2019-07-18 M. A. Sofi

The Chinese Remainder Theorem for the integers says that every system of congruence equations is solvable as long as the system satisfies an obvious necessary condition. This statement can be generalized in a natural way to arbitrary…

Computational Complexity · Computer Science 2023-07-07 Miguel Campercholi , Diego Castaño , Gonzalo Zigarán

We apply ideas from the theory of limits of dense combinatorial structures to study order types, which are combinatorial encodings of finite point sets. Using flag algebras we obtain new numerical results on the Erd\H{o}s problem of finding…

A continuous constraint satisfaction problem (CCSP) is a constraint satisfaction problem (CSP) with an interval domain $U \subset \mathbb{R}$. We engage in a systematic study to classify CCSPs that are complete of the Existential Theory of…

Computational Complexity · Computer Science 2024-08-07 Tillmann Miltzow , Reinier F. Schmiermann

We present a substantial generalisation of a classical result by Lie on integrability by quadratures. Namely, we prove that all vector fields in a finite-dimensional transitive and solvable Lie algebra of vector fields on a manifold can be…

Mathematical Physics · Physics 2016-11-03 J. F. Cariñena , F. Falceto , J. Grabowski

Orbit-finite models of computation generalise the standard models of computation, to allow computation over infinite objects that are finite up to symmetries on atoms, denoted by $\mathbb{A}$. Set theory with atoms is used to reason about…

Logic · Mathematics 2025-12-03 Jake Masters

The aim of this paper is to to show the admissibility of some class of Frechet spaces (see Definition 2.3). In particular, this generalizes the main results of [3]. As an application, we show the admissibility of a large class modular…

Functional Analysis · Mathematics 2021-12-02 Maciej Ciesielski , Grzegorz Lewicki

We study the collection of first-order logical schemata all of whose instances are theorems of a given theory $T$; we call these the validities of $T$ ($\mathsf{V}(T)$). It is easy to see that if $T$ is a decidable theory, then…

Logic · Mathematics 2026-05-26 Denis R. Hirschfeldt , Henry Towsner , Scott Weinstein

We prove a scheme-theoretic version of Mnev-Sturmfels Universality, suitable to be used in the proof of Murphy's Law in Algebraic Geometry. Somewhat more precisely, we show that any singularity type of finite type over Z appears on some…

Algebraic Geometry · Mathematics 2012-08-17 Seok Hyeong Lee , Ravi Vakil

We discuss linear algebra of infinite-dimensional vector spaces in terms of algebraic (Hamel) bases. As an application we prove the surjectivity of a large class of linear partial differential operators with smooth ($\mathcal…

Analysis of PDEs · Mathematics 2021-06-09 Todor D. Todorov

In this paper we investigate formal verification problems for Neural Network computations. Various reachability problems will be in the focus, such as: Given symbolic specifications of allowed inputs and outputs in form of Linear…

Computational Complexity · Computer Science 2023-06-12 Adrian Wurm