相关论文: On needed reals

We consider the covering map $\pi:\mathbb{C}^n\to \mathbb{T}$ of a compact complex torus. Given an algebraic variety $X\subseteq \mathbb{C}^n$ we describe the topological closure of $\pi(X)$ in $\mathbb T$. We obtain a similar description…

We discuss how to write down three specific natural numbers $A$, $B$, $C$ such that for any real number $r$ you've probably ever thought of, it is consistent with $\mathsf{ZFC}$ set theory that $$\def\Rb{\mathbb{R}}\def\Nb{\mathbb{N}}r =…

An unsatisfiable formula is called minimal if it becomes satisfiable whenever any of its clauses are removed. We construct minimal unsatisfiable $k$-SAT formulas with $\Omega(n^k)$ clauses for $k \geq 3$, thereby negatively answering a…

We consider databases in which each attribute takes values from a partially ordered set (poset). This allows one to model a number of interesting scenarios arising in different applications, including quantitative databases, taxonomies, and…

For any power series $a(t)$ with exponentially bounded nonnegative integer coefficients we suggest a simple construction of a finitely generated monomial associative algebra $R$ with Hilbert series $H(R,t)$ very close to $a(t)$. If $a(t)$…

We demonstrate that commutativity of numerous one-dimensional subalgebras in $W_{1+\infty}$ algebra, i.e. the existence of many non-trivial integrable systems described in recent arXiv:2303.05273 follows from the subset of relations in…

Relation extraction has the potential for large-scale knowledge graph construction, but current methods do not consider the qualifier attributes for each relation triplet, such as time, quantity or location. The qualifiers form…

Given a polynomial $f$ and a semi-algebraic set $S$, we provide a symbolic algorithm to find the equations and inequalities defining a semi-algebraic set $Q$ which is identical to the closure of the image of $S$ under $f$, i.e.,…

This paper presents a sound and completecalculus for causal relevance, based onPearl's functional models semantics.The calculus consists of axioms and rulesof inference for reasoning about causalrelevance relationships.We extend the set of…

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.…

We say that a function is rare-case hard against a given class of algorithms (the adversary) if all algorithms in the class can compute the function only on an $o(1)$-fraction of instances of size $n$ for large enough $n$. Starting from any…

Rice's Theorem states that every nontrivial language property of the recursively enumerable sets is undecidable. Borchert and Stephan initiated the search for complexity-theoretic analogs of Rice's Theorem. In particular, they proved that…

We provide requirements on effectively enumerable topological spaces which guarantee that the Rice-Shapiro theorem holds for the computable elements of these spaces. We show that the relaxation of these requirements leads to the classes of…

The representer theorem is one of the most important mathematical foundations for regularised learning and kernel methods. Classical formulations of the theorem state sufficient conditions under which a regularisation problem on a Hilbert…

This paper presents the following results on sets that are complete for NP. 1. If there is a problem in NP that requires exponential time at almost all lengths, then every many-one NP-complete set is complete under length-increasing…

Given an $n$-ary $k-$valued function $f$, $gap(f)$ denotes the minimal number of essential variables in $f$ which become fictive when identifying any two distinct essential variables in $f$. We particularly solve a problem concerning the…

We say that a list of real numbers is "symmetrically realisable" if it is the spectrum of some (entrywise) nonnegative symmetric matrix. The Symmetric Nonnegative Inverse Eigenvalue Problem (SNIEP) is the problem of characterising all…

Necessary and sufficient condition is given for a set $A\subset R^1$ to be a subset of the critical values set for a $C^k$ function $f:R^m \to R^1$.

This paper presents a solution to a problem from superanalysis about the existence of Hilbert-Banach superalgebras. Two main results are derived: 1) There exist Hilbert norms on some graded algebras (infinite-dimensional superalgebras…

The purpose of this paper is to define semi- and subanalytic subsets and maps in the context of real analytic orbifolds and to study their basic properties. We prove results analogous to some well-known results in the manifold case. For…