Related papers: Connected Choice and the Brouwer Fixed Point Theor…
The problem of uniqueness of universal formulae for (quantum) dimensions of simple Lie algebras is investigated. We present generic functions, which multiplied by a universal (quantum) dimension formula, preserve both its structure and its…
In this work, using a new geometrical approach we study to the existence of the fixed-point of mappings that independence of the smoothness, and also of their single-values or multi-values. This work proved the theorems that generalize in…
A uniform approach to computing with infinite objects like real numbers, tuples of these, compacts sets, and uniformly continuous maps is presented. In work of Berger it was shown how to extract certified algorithms working with the signed…
We study the computational content of various theorems with reverse mathematical strength around Arithmetical Transfinite Recursion ($\mathsf{ATR}_0$) from the point of view of computability-theoretic reducibilities, in particular Weihrauch…
An arithmetical discrete plane is said to have critical connecting thickness if its thickness is equal to the infimum of the set of values that preserve its $2$-connectedness. This infimum thickness can be computed thanks to the fully…
In a graph, a matching cut is an edge cut that is a matching. Matching Cut is the problem of deciding whether or not a given graph has a matching cut, which is known to be NP-complete even when restricted to bipartite graphs. It has been…
In this paper we show the equivalence among three conjectures (and related open questions), namely, the embedding of univalent maps of the unit ball into Loewner chains, the approximation of univalent maps with entire univalent maps and the…
We provide a new characterisation of the decades old open problem of extending bilipschitz mappings given on a Euclidean separated net. In particular, this allows for the complete positive solution of the open problem in dimension two.…
The purpose of this note is to prove the existence of a randomized mechanism, a social decision scheme (SDS), with desirable fairness, efficiency, and strategyproofness properties unmatched by all known SDSs. In particular, we disprove a…
In this note, we define a bounded variant on the Hilbert projective metric on an infinite dimensional space $E$ and study the contraction properties of the projective maps associated with positive linear operators on $E$. More precisely, we…
We prove that in a Euclidean space of dimension at least two, there exists a compact set of Lebesgue measure zero such that any real-valued Lipschitz function defined on the space is differentiable at some point in the set. Such a set is…
In this paper, we present the Brouwer-Schauder-Tychonoff fixed point theorem on locally convex spaces as the following extension and improvement: Suppose that S is a compact star-shaped subset with respect to p in S with its convexity index…
We introduce and study the notion of an outer bi-Lipschitz extension of a map between Euclidean spaces. The notion is a natural analogue of the notion of a Lipschitz extension of a Lipschitz map. We show that for every map $f$ there exists…
We consider a new type of mappings in metric spaces which can be characterized as mappings contracting perimeters of triangles. It is shown that such mappings are continuous. The fixed-point theorem for such mappings is proved and the…
Fixed point combinators (and their generalization: looping combinators) are classic notions belonging to the heart of lambda-calculus and logic. We start with an exploration of the structure of fixed point combinators (fpc's), vastly…
We introduce a notion of a connection on a coherent sheaf on a weighted projective line (in the sense of Geigle and Lenzing). Using a theorem of Huebner and Lenzing we show, under a mild hypothesis, that if one considers coherent sheaves…
The set of permutations on a finite set can be given the lattice structure known as the weak Bruhat order. This lattice structure is generalized to the set of words on a fixed alphabet $\Sigma$ = {x,y,z,...}, where each letter has a fixed…
We study the existence of fixed points for continuous maps $f$ from an $n$-ball $X$ in $\mathbb R^n$ to $\mathbb R^n$ with $n\geq 1$. We show that $f$ has a fixed point if, for some absolute retract $Y\subset\partial X$, $f(Y)\subset X$ and…
In the current paper we present a new proof of the small ball inequality in two dimensions. More importantly, this new argument, based on an approach inspired by lacunary Fourier series, reveals the first formal connection between this…
We study the control of nonlinear constrained systems via over-approximations. Our key observation is that the over-approximation error, rather than being an unknown disturbance, can be exploited as input-dependent preview information. This…