Related papers: Connected Choice and the Brouwer Fixed Point Theor…
We continue our study of 'no-dimension' analogues of basic theorems in combinatorial and convex geometry in Banach spaces. We generalize some results of the paper \cite{adiprasito2019theorems} and prove no-dimension versions of colorful…
We consider the problem of digitalizing Euclidean segments. Specifically, we look for a constructive method to connect any two points in $\mathbb{Z}^d$. The construction must be {\em consistent} (that is, satisfy the natural extension of…
Brouwer's fixed point theorem from 1911 is a basic result in topology - with a wealth of combinatorial and geometric consequences. In these lecture notes we present some of them, related to the game of HEX and to the piercing of multiple…
In this paper using Sperner's lemma for modified partition of a simplex we will constructively prove Brouwer's fixed point theorem for sequentially locally non-constant and uniformly sequentially continuous functions.
A number of landmark existence theorems of nonlinear functional analysis follow in a simple and direct way from the basic separation of convex closed sets in finite dimension via elementary versions of the Knaster-Kuratowski-Mazurkiewicz…
We show the direct applicability of the Brouwer fixed point theorem for the existence of equilibrium points and periodic solutions for differential systems on general domains satisfying geometric conditions at the boundary. We develop a…
We introduce an operator on problems in Weihrauch complexity, which we call the inverse limit, and which corresponds to an infinite compositional product. This operation arises naturally whenever one implements algorithms that produce a…
We consider the problem of finding weights and biases for a two-layer fully connected neural network to fit a given set of data points as well as possible, also known as EmpiricalRiskMinimization. Our main result is that the associated…
We review and possibly add some new variant to the existing derivations of the formula for the area of Jordan lattice polygons drawn on two-dimensional lattices. The formula is known as Pick's theorem and is related to the number theory…
This paper compares different representations (in the sense of computable analysis) of a number of function spaces that are of interest in analysis. In particular subspace representations inherited from a larger function space are compared…
In statistical relational learning, the link prediction problem is key to automatically understand the structure of large knowledge bases. As in previous studies, we propose to solve this problem through latent factorization. However, here…
This article concerns the Herrlich-Chew theorem stating that a Hausdorff zero-dimensional space is $\mathbb{N}$-compact if and only if every clopen ultrafilter with the countable intersection property in this space is fixed. It also…
This paper represents a step in our program towards the proof of the Pierce--Birkhoff conjecture. In the nineteen eighties J. Madden proved that the Pierce-Birkhoff conjecture for a ring A$is equivalent to a statement about an arbitrary…
Recently a conformally invariant action describing the Wilson-Fischer fixed point in $D=4-\epsilon$ dimensions in the presence of a {\em finite} UV cutoff was constructed \cite{Dutta}. In the present paper we construct two composite…
In the setting of constructive reverse mathematics, we analyse the downward L\"owenheim-Skolem (DLS) theorem of first-order logic, stating that every infinite model has a countable elementary submodel. Refining the well-known equivalence of…
Conjugation, or Legendre transformation, is a basic tool in convex analysis, rational mechanics, economics and optimization. It maps a function on a linear topological space into another one, defined in the dual of the linear space by…
We investigate the relationship between connectedness properties of spectra and the Lyubeznik numbers, numerical invariants defined via local cohomology. We prove that for complete equidimensional local rings, the Lyubeznik numbers…
We consider a unique continuation problem where the Dirichlet trace of the solution is known to have finite dimension. We prove Lipschitz stability of the unique continuation problem and design a finite element method that exploits the…
We construct a bi-Lipschitz bijection from the Boolean cube to the Hamming ball of equal volume. More precisely, we show that for all even n there exists an explicit bijection f from the n-dimensional Boolean cube to the Hamming ball of…
We introduce and study the notion of overt choice for countably-based spaces and for CoPolish spaces. Overt choice is the task of producing a point in a closed set specified by what open sets intersect it. We show that the question of…