English
Related papers

Related papers: Arbitrarily Close for Summer 2022 Analysis

200 papers

Oriented closed curves on an orientable surface with boundary are described up to continuous deformation by reduced cyclic words in the generators of the fundamental group and their inverses. By self-intersection number one means the…

Geometric Topology · Mathematics 2011-08-03 Moira Chas , Steven P. Lalley

Limit can be defined by two axioms: 1. Strict inequality between limits implies, ultimately, strict inequality between functions. 2. For constant functions limit is trivial. How can basic results on convergence be derived from these axioms?…

History and Overview · Mathematics 2008-05-26 Bogdan M. Baishanski

A theory of sketches for arithmetic universes (AUs) is developed. A restricted notion of sketch, called here "context", is defined with the property that every non-strict model is uniquely isomorphic to a strict model. This allows us to…

Category Theory · Mathematics 2016-08-05 Steven Vickers

A finite-dimensional unital and associative algebra over $\mathbb{R}$, or what we shall call simply "an algebra" in this paper for short, generalities the construction by which we derive the complex numbers by "adjoining an element $i$" to…

Rings and Algebras · Mathematics 2017-08-04 Nathan BeDell

We describe a procedure based on the iteration of an initial function by an appropriated operator, acting on continuous functions, in order to get a fixed point. This fixed point will be a calibrated subaction for the doubling map on the…

Dynamical Systems · Mathematics 2020-10-26 Hermes H. Ferreira , Artur O. Lopes , Elismar R. Oliveira

We introduce and investigate a new notion of the theory of approximation-the so-called degenerate approximation, i.e. approximation of the function of two (and more) variables (kernel) by means of degenerate function (kernel). We apply…

Probability · Mathematics 2013-03-14 E. Ostrovsky , L. Sirota

In this paper, we define concept of approximate fixed point property of a function and a set in intuitionistic fuzzy normed space. Furthermore, we give intuitionistic fuzzy version of some class of maps used in fixed point theory and…

Functional Analysis · Mathematics 2015-09-10 Müzeyyen Ertürk , Vatan Karakaya , M. Mursaleem

The essence of good creative writing is calibrated surprise: when constraints from all relevant dimensions act together, the feasible solution space collapses into a narrow region, and the surviving choices look least predictable from an…

Computation and Language · Computer Science 2026-04-30 Bo Zou , Chao Xu

LocatedNear relation is a kind of commonsense knowledge describing two physical objects that are typically found near each other in real life. In this paper, we study how to automatically extract such relationship through a sentence-level…

Computation and Language · Computer Science 2018-05-15 Frank F. Xu , Bill Yuchen Lin , Kenny Q. Zhu

An abstract machine is a theoretical model designed to perform a rigorous study of computation. Such a model usually consists of configurations, instructions, programs, inputs and outputs for the machine. In this paper we formalize these…

Logic in Computer Science · Computer Science 2010-07-21 Zhaohua Luo

In this expository article intended to be accessible to undergraduate students we introduce a finite abelian group that can be associated to any finite connected graph. This group can be defined in an elementary combinatorial way in terms…

Combinatorics · Mathematics 2022-01-24 Darren Glass , Nathan Kaplan

We present and study new definitions of universal and programmable universal unary functions and consider a new simplicity criterion: almost decidability of the halting set. A set of positive integers S is almost decidable if there exists a…

Computational Complexity · Computer Science 2015-05-07 Cristian S. Calude , Damien Desfontaines

A concept of "guessability" is defined for sets of sequences of naturals. Eventually, these sets are thoroughly characterized. To do this, a nonstandard logic is developed, a logic containing symbols for the ellipsis as well as for…

Logic · Mathematics 2012-01-25 Samuel Alexander

Predictions in the form of sets of probability distributions, so-called credal sets, provide a suitable means to represent a learner's epistemic uncertainty. In this paper, we propose a theoretically grounded approach to credal prediction…

Machine Learning · Statistics 2025-12-16 Timo Löhr , Paul Hofman , Felix Mohr , Eyke Hüllermeier

We study a generalization of classical active learning to real-world settings with concrete prediction targets where sampling is restricted to an accessible region of the domain, while prediction targets may lie outside this region. We…

Machine Learning · Computer Science 2025-02-11 Jonas Hübotter , Bhavya Sukhija , Lenart Treven , Yarden As , Andreas Krause

For every finite closure space $X$ one can define a finite topological space $\operatorname{Top} X$ together with a natural projection $\operatorname{Top} X\longrightarrow X$. This could allow to apply the techniques of topological…

General Topology · Mathematics 2021-11-29 Josef Eschgfäller

The semantic paradoxes are associated with self-reference or referential circularity. However, there are infinitary versions of the paradoxes, such as Yablo's paradox, that do not involve this form of circularity. It remains an open…

Combinatorics · Mathematics 2021-04-13 Brian Rabern , Landon Rabern

While the utility of well-chosen abstractions for understanding and predicting the behaviour of complex systems is well appreciated, precisely what an abstraction $\textit{is}$ has so far has largely eluded mathematical formalization. In…

Artificial Intelligence · Computer Science 2021-06-29 Beren Millidge

We consider the set of pairs of orthogonal vectors in Hilbert space, which is also called the cross because it is the union of the horizontal and vertical axes in the Euclidean plane when the underlying space is the real line. Crosses,…

Optimization and Control · Mathematics 2022-02-04 Heinz H. Bauschke , Manish Krishan Lal , Xianfu Wang

This paper presents a theory of systemic undecidability, reframing incomputability as a structural property of systems rather than a localized feature of specific functions or problems. We define a notion of causal embedding and prove a…

Logic in Computer Science · Computer Science 2025-09-03 Seth Bulin
‹ Prev 1 8 9 10 Next ›