Related papers: A universality theorem for allowable sequences wit…
Let $M$ be a tame mouse modelling ZFC. We show that $M$ satisfies "$V=\mathrm{HOD}_x$ for some real $x$", and that the restriction $\mathbb{E}\upharpoonright[\omega_1^M,\mathrm{OR}^M)$ of the extender sequence $\mathbb{E}^M$ of $M$ to…
A definition of summability is put forward in the framework of general Carleman ultraholomorphic classes in sectors, so generalizing $k-$summability theory as developed by J.-P. Ramis. Departing from a strongly regular sequence of positive…
A theorem of Y. Berest, P. Etingof and V. Ginzburg states that finite dimensional irreducible representations of a type A rational Cherednik algebra are classified by one rational number m/n. Every such representation is a representation of…
In 1895, Cantor showed that between every two countable dense real sets, there is an order isomorphism. In fact, there is always such an order isomorphism, which is the restriction of a universal entire function.
Many practical problems need the output of a machine learning model to satisfy a set of constraints, $K$. Nevertheless, there is no known guarantee that classical neural network architectures can exactly encode constraints while…
We define E-theory for separable C*-algebras over second countable topological spaces and establish its basic properties. This includes an approximation theorem that relates the E-theory over a general space to the E-theories over finite…
We advance a general theory of coherent preference that surrenders restrictions embodied in orthodox doctrine. This theory enjoys the property that any preference system admits extension to a complete system of preferences, provided it…
We study the following fundamental realization problem of directed acyclic graphs (dags). Given a sequence S:=(a_1,b_1),...,(a_n, b_n) with a_i, b_i in Z_0^+, does there exist a dag (no parallel arcs allowed) with labeled vertex set V:=…
A $3$-uniform hypergraph is a generalization of simple graphs where each hyperedge is a subset of vertices of size $3$. The degree of a vertex in a hypergraph is the number of hyperedges incident with it. The degree sequence of a hypergraph…
A new and extensive formalism is developed for monads and galaxies in non-standard enlargements. It is shown that monads and galaxies can be manipulated using order-preserving and order-reversing set-to-set maps, and that set properties…
The notion of unboundedly order converges has been recieved recently a particular attention by several authors. The main result of the present paper shows that the notion is efficient and deserves that care. It states that a vector lattice…
Selman's Theorem in classical Computability Theory gives a characterization of the enumeration reducibility for arbitrary sets in terms of the enumeration reducibility on the total sets: $A \le_e B \iff \forall X [X \equiv_{e} X \oplus…
In this paper, we study the endomorphism properties of vertex operator algebras over an arbitrary field $\mathbb{F}$, with $\text{Char}(\mathbb{F}) \neq 2$. Let $V$ be a strongly finitely generated vertex operator algebra over $\mathbb{F}$,…
We consider the decidability of state-to-state reachability in linear time-invariant control systems over continuous time. We analyse this problem with respect to the allowable control sets, which are assumed to be the image under a linear…
In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…
Sequence theories are an extension of theories of strings with an infinite alphabet of letters, together with a corresponding alphabet theory (e.g. linear integer arithmetic). Sequences are natural abstractions of extendable arrays, which…
Robertson (1988) suggested a model for the realization space of a convex d-dimensional polytope and an approach via the implicit function theorem, which -- in the case of a full rank Jacobian -- proves that the realization space is a…
Let $(X,d,p)$ be a pointed metric space. A pretangent space to $X$ at $p$ is a metric space consisting of some equivalence classes of convergent to $p$ sequences $(x_n), x_n \in X,$ whose degree of convergence is comparable with a given…
In this paper, we study the summability properties of double sequences of real constants which map sequences of random variables to sequences of random variables that are defined on the same probability sample space. We show that a regular…
The distinguishing result of this paper is a $\mathbf{P}$-time enumerable partition of all the potential perfect matchings in a bipartite graph. This partition is a set of equivalence classes induced by the missing edges in the potential…