Related papers: Arbitrarily Close
We formulate problems of tight closure theory in terms of projective bundles and subbundles. This provides a geometric interpretation of such problems and allows us to apply intersection theory to them. This yields new results concerning…
In this paper we introduce the notion of elementary numerosity as a special function defined on all subsets of a given set X which takes values in a suitable non-Archimedean field, and satisfies the same formal properties of finite…
In his article "Arithmetic Fujita Approximations", Huayi Chen introduces the notion of an approximable graded algebra and asks if any such algebra is a subalgebra of the graded section ring of a big line bundle on an algebraic variety. We…
An alternative mathematics based on qualitative plurality of finiteness is developed to make non-standard mathematics independent of infinite set theory. The vague concept "accessibility" is used coherently within finite set theory whose…
Two types of approximation to the paradoxical Russell Set are presented, one approximating it from below, one from above. It is shown that any lower approximation gives rise to a better approximation containing it, and that any upper…
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…
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…
This paper proposes a method to compute finite abstractions that can be used for synthesizing robust hybrid control strategies for nonlinear systems. Most existing methods for computing finite abstractions utilize some global, analytical…
A contractive condition is addressed for extended 2-cyclic self-mappings on the union of a finite number of subsets of a metric space which are allowed to have a finite number of successive images in the same subsets of its domain. It is…
Simple methods permit to generalize the concepts of iteration and of recursive processes. We shall see briefly on several examples what these methods generate. In additive sequences, we shall encounter not only the golden or the silver…
We define a notion of randomness for individual and collections of formal languages based on automatic martingales acting on sequences of words from some underlying domain. An automatic martingale bets if the incoming word belongs to the…
In this paper, we consider the problem of how to establish algebraic structures on nearness approximation spaces. Essentially, our approach is to define the nearness ring, nearness ideal and nearness ring of all weak cosets by considering…
We prove a sharp bound for the remainder term of the number of lattice points inside a ball, when averaging over a compact set of (not necessarily unimodular) lattices, in dimensions two and three. We also prove that such a bound cannot…
I discuss group averaging as a method for quantising constrained systems whose gauge group is a noncompact Lie group. Focussing on three case studies, I address the convergence of the averaging, possible indefiniteness of the prospective…
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…
We introduce the notion of a critical cardinal as the critical point of sufficiently strong elementary embedding between transitive sets. Assuming the axiom of choice this is equivalent to measurability, but it is well-known that choice is…
Every lattice is isomorphic to a lattice whose elements are sets of sets, and whose operations are intersection and an operation extending the union of two sets of sets A and B by the set of all sets in which the intersection of an element…
Using tools from topology and functional analysis, we provide a framework where artificial neural networks, and their architectures, can be formally described. We define the notion of machine in a general topological context and show how…
The present work aims to exploit the interplay between the algebraic properties of rings and the graph-theoretic structures of their associated graphs. We introduce commutatively closed graphs and investigate properties of commutatively…
Interconnected networks are mathematical representation of systems where two or more simple networks are coupled to each other. Depending on the coupling weight between the two components, the interconnected network can function in two…