English
Related papers

Related papers: Embeddability on functions: order and chaos

200 papers

In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…

Computational Complexity · Computer Science 2016-08-15 Peter Franek , Stefan Ratschan , Piotr Zgliczynski

The main result is the following. Let $f \colon X \rightarrow Y$ be a continuous mapping of a completely Baire space $X$ onto a hereditary weakly Preiss-Simon regular space $Y$ such that the image of every open subset of $X$ is a resolvable…

General Topology · Mathematics 2022-08-12 Sergey Medvedev

We provide analogues of the results from [FMR11, CMMR13] in the reference list (which correspond to the case $\kappa = \omega$) for arbitrary $\kappa$-Souslin quasi-orders on any Polish space, for $\kappa$ an infinite cardinal smaller than…

Logic · Mathematics 2019-03-19 Alessandro Andretta , Luca Motto Ros

The Eremenko-Lyubich class consists of transcendental entire functions with bounded singular set and the Speiser class is made up of functions with a finite singular set. In an earlier paper "Models for the Eremenko-Lyubich class" I gave a…

Complex Variables · Mathematics 2025-01-06 Christopher J. Bishop

We generalize the existence of maximal orders in a semi-simple algebra for general ground rings. We also improve several statements in Chapter 5 and 6 of Reiner's book concerning separable algebras by removing the separability condition,…

Number Theory · Mathematics 2011-05-17 Chia-Fu Yu

Given two independent point processes and a certain rule for matching points between them, what is the fraction of matched points over infinitely long streams? In many application contexts, e.g., secure networking, a meaningful matching…

Information Theory · Computer Science 2016-11-17 Stefano Marano , Vincenzo Matta , Ting He , Lang Tong

In this article we provide an intrinsic characterization of the famous Howard-Bachmann ordinal in terms of a natural well-partial-ordering by showing that this ordinal can be realized as a maximal order type of a class of generalized trees…

Logic · Mathematics 2015-01-06 Jeroen Van der Meeren , Michael Rathjen , Andreas Weiermann

Submodular function maximization has been studied extensively in recent years under various constraints and models. The problem plays a major role in various disciplines. We study a natural online variant of this problem in which elements…

Data Structures and Algorithms · Computer Science 2015-01-26 Niv Buchbinder , Moran Feldman , Roy Schwartz

Using complex methods combined with Baire's Theorem we show that one-sided extendability, extendability and real analyticity are rare phenomena on various spaces of functions in the topological sense. These considerations led us to…

Complex Variables · Mathematics 2018-04-03 E. Bolkas , V. Nestoridis , C. Panagiotis , M. Papadimitrakis

We introduce a very natural topology on the set of total orderings of monomials of any algebra having a countable basis over a field. This topological space and some notable subspaces are compact. This topological framework allows us to…

Rings and Algebras · Mathematics 2011-06-02 Roberto Boldini

Completeness for a (topological) space is often based on the existence of special structures (such as metrics, uniformities, proximities, convergences, etc) that explicitly induce the topology, making the completeness induction-dependent.…

General Topology · Mathematics 2026-03-06 Earnest Akofor

Submodular functions are a fundamental object of study in combinatorial optimization, economics, machine learning, etc. and exhibit a rich combinatorial structure. Many subclasses of submodular functions have also been well studied and…

Data Structures and Algorithms · Computer Science 2013-04-19 Nikhil R. Devanur , Shaddin Dughmi , Roy Schwartz , Ankit Sharma , Mohit Singh

We study classes of graphs with bounded clique-width that are well-quasi-ordered by the induced subgraph relation, in the presence of labels on the vertices. We prove that, given a finite presentation of a class of graphs, one can decide…

Combinatorics · Mathematics 2026-05-29 Maël Dumas , Aliaume Lopez

We want to give a construction as simple as possible of a Borel subset of a product of two Polish spaces. This introduces the notion of potential Wadge class. Among other things, we study the non-potentially closed sets, by proving…

Logic · Mathematics 2007-10-02 Dominique Lecomte

In this paper, we prove a theorem about embedding of some partially ordered topological spaces in topological hyperspaces equipped with Fell topology. Then we give some examples to show that the map defining the embedding may not be…

General Topology · Mathematics 2021-12-23 Jinlu Li

We consider fairness in submodular maximization subject to a knapsack constraint, a fundamental problem with various applications in economics, machine learning, and data mining. In the model, we are given a set of ground elements, each…

Data Structures and Algorithms · Computer Science 2025-05-20 Lijun Li , Chenyang Xu , Liuyi Yang , Ruilong Zhang

We construct a weakly compact convex subset of $\ell^2$ with nonempty interior that has an isolated maximal element, with respect to the lattice order $\ell _+^2$. Moreover, the maximal point cannot be supported by any strictly positive…

Functional Analysis · Mathematics 2024-07-19 Aris Daniilidis , Carlo de Bernardi , Enrico Miglierina

We study Baire category for subsets of 2^omega that are downward-closed with respect to the almost-inclusion ordering (on the power set of the natural numbers, identified with 2^omega). We show that it behaves better in this context than…

Logic · Mathematics 2009-09-25 Andreas Blass

A function from Baire space to the natural numbers is called formally continuous if it is induced by a morphism between the corresponding formal spaces. We compare formal continuity to two other notions of continuity on Baire space working…

Logic · Mathematics 2017-10-25 Tatsuji Kawai

We explain how to see finite combinatorics of preorders implicit in the {text} of basic topological definitions or arguments in (Bourbaki, General topology, Ch.I), and define a concise combinatorial notation such that complete definitions…

Category Theory · Mathematics 2024-10-01 Misha Gavrilovich