相关论文: Using nets in Dedekind, monotone, or Scott incompl…
These are some informal remarks on quadratic orbital networks over finite fields. We discuss connectivity, Euler characteristic, number of cliques, planarity, diameter and inductive dimension. We find a non-trivial disconnected graph for…
Given a densely defined and gapped symmetric operator with infinite deficiency index, it is shown how self-adjoint extensions admitting arbitrarily prescribed portions of the gap as essential spectrum are identified and constructed within a…
It is shown how Dedekind cuts can be used to introduce the extended real numbers along with sound arithmetic laws via one simple rule for the addition of sets. The crucial idea is that the use of the lower and the upper part of the cuts,…
Let $ D $ be a finite digraph, and let $ V_0,\dots,V_{k-1} $ be nonempty subsets of $ V(D) $. The (strong form of) Edmonds' branching theorem states thatthere are pairwise edge-disjoint spanning branchings $ \mathcal{B}_0,\dots,…
We characterize those algebras over a disconnected uniformly complete topological field which are representable as algebras of continuous functions on compact topological spaces, generalizing thus Gelfand duality for non-archimedean normed…
Completions play an important r\^ole for studying structure by supplying elements that in some sense ``ought to be." Among these, the Dedekind-MacNeille completion is of particular importance. In 1968 Janowitz provided necessary and…
This note generalizes Berge's maximum theorem to noncompact image sets. It is also clarifies the results from E.A. Feinberg, P.O. Kasyanov, N.V. Zadoianchuk, "Berge's theorem for noncompact image sets," J. Math. Anal. Appl. 397(1)(2013),…
We investigate infinite sets that witness the failure of certain Ramsey-theoretic statements, such as Ramsey's or (appropriately phrased) Hindman's theorem; such sets may exist if one does not assume the Axiom of Choice. We obtain very…
In this article we discuss a possibility to implement a well-known scheme of proof for contraction mapping theorems in a situation, when convergence, families of Cauchy sequences, and contractiveness of mappings are defined axiomatically.…
A polytope is called indecomposable if it cannot be expressed nontrivially as a Minkowski sum of other polytopes. Since Gale introduced the concept in 1954, several increasingly strong criteria have been developed to characterize…
The central purpose of this article is to establish new inverse and implicit function theorems for differentiable maps with isolated critical points. One of the key ingredients is a discovery of the fact that differentiable maps with…
We prove a rank-finiteness conjecture for modular categories: up to equivalence, there are only finitely many modular categories of any fixed rank. Our technical advance is a generalization of the Cauchy theorem in group theory to the…
Many of the theorems of real analysis, against the background of the ordered field axioms, are equivalent to Dedekind completeness, and hence can serve as completeness axioms for the reals. In the course of demonstrating this, the article…
In our work, we provide a constructive proof of a generalized version of Cantor's diagonal argument for nets. This result expands the well-known technique beyond sequences, allowing it to be applied to a broader context. This result has…
We prove a fixed point theorem that combines the contraction mapping principle and some Knaster-Tarski-like theorem. As a consequence we obtain an existence theorem to initial value problem for ordinary differential equation with…
It is well-known that entire functions whose spectrum belongs to a fixed bounded set $S$ admit real uniformly discrete uniqueness sets $\Lambda$. We show that the same is true for much wider spaces of continuous functions. In particular,…
Von Neumann's original proof of the ergodic theorem is revisited. A uniform convergence rate is established under the assumption that one can control the density of the spectrum of the underlying self-adjoint operator when restricted to…
We establish uniform bounds on the multiplicities of irreducible admissible representations appearing in spaces of functions on symmetric spaces over $p$-adic fields. These multiplicities can exceed one and depend intricately on the group,…
While modal extensions of decidable fragments of first-order logic are usually undecidable, their monodic counterparts, in which formulas in the scope of modal operators have at most one free variable, are typically decidable. This only…
Consider a definable complete d-minimal expansion $(F, <, +, \cdot, 0, 1, \dots,)$ of an oredered field $F$. Let $X$ be a definably compact definably normal definable $C^r$ manifold and $2 \le r <\infty$. We prove that the set of definable…