相关论文: A cardinal number connected to the solvability of …

Let $\mathbf{x}$ be a (non-empty) sequence of positive real numbers. Its achievement set $\mathcal{\mathbf{x}}$ is the set of all the possible sums of the elements of $\mathbf{x}$. The cardinal function of $\mathbf{x}$ is the function…

Consider a nonsolvable finite group G, where R(G) represents the solvable radical of G. For any element x in G, the solvabilizer of x in G, denoted by Sol_G(x), is defined as the set of all elements y in G such that the subgroup generated…

A function f from reals to reals (f:R->R) is almost continuous (in the sense of Stallings) iff every open set in the plane which contains the graph of f contains the graph of a continuous function. Natkaniec showed that for any family F of…

Many AI-related reasoning problems are based on the problem of satisfiability of propositional formulas with some cardinality-minimality condition. While the complexity of the satisfiability problem (SAT) is well understood when considering…

We consider the class $\mathcal{S}^*(q_c)$ of normalized starlike functions $f$ analytic in the open unit disk $|z|<1$ that satisfying the inequality \begin{equation*} \left|\left(\frac{zf'(z)}{f(z)}\right)^2-1\right|<c \quad (0<c\leq1).…

This paper enriches preexisting satisfiability tests for unquantified languages, which in turn augment a fragment of Tarski's elementary algebra with unary real functions possessing a continuous first derivative. Two sorts of individual…

The work presents the brief exposition of the proof (in ZF) of inaccessible cardinals nonexistence. To this end in view there is used the apparatus of subinaccessible cardinals and its basic tools -- reduced formula spectra and matrices and…

Conditions for the unique solvability of the Cauchy problem for a family of scalar functional differential equations are obtained. These conditions are sufficient for the solvability of the Cauchy problem for every equation from the family…

The essential variables in a finite function $f$ are defined as variables which occur in $f$ and weigh with the values of that function. The number of essential variables is an important measure of complexity for discrete functions. When…

Let $\mathcal{I}$ be an ideal on $\omega$. For $f,g\in\omega^\omega$ we write $f \leq_{\mathcal{I}} g$ if $f(n) \leq g(n)$ for all $n\in\omega\setminus A$ with some $A\in\mathcal{I}$. Moreover, we denote…

A proof that the set of real numbers is denumerable is given.

Several classes of classical cardinal B-splines can be obtained as solutions of operator equations of the form $Ly = 0$ where $L$ is a linear differential operator of integral order. (Cf., for instance,…

A group G that is not finitely generated can be written as the union of a chain of proper subgroups. The cofinality spectrum of G, written CF(S), is the set of regular cardinals lambda such that G can be expressed as the union of a chain of…

Towards the study of the Kashiwara B(infinity) crystal, sets H^t of functions were introduced given by equivalence classes of unordered partitions satisfying certain boundary conditions. Here it is shown that H^t is a Catalan set of order…

Given a function $f \in \omega^\omega$, a set $A \in [\omega]^\omega$ is free for $f$ if $f[A] \cap A$ is finite. For a class of functions $\Gamma \subseteq \omega^{\omega}$, we define $\mathfrak{ros}_\Gamma$ as the smallest size of a…

In $\mathsf{ZFC}$, if there is a measurable cardinal with infinitely many Woodin cardinals below it, then for every equivalence relation $E \in L(\mathbb{R})$ on $\mathbb{R}$ with all $\mathbf{\Delta}_1^1$ classes and every $\sigma$-ideal…

We compute the cardinality $\mathfrak n_{\dim}(\mathcal M)$ of the sets of dimension functions on the ordered structures $\mathcal M$. The inequality $\mathfrak n_{\dim}(\mathcal M) \leq 1$ holds if $\mathcal M$ is a d-minimal expansion of…

We examine the relation of BSS-reducibility on subsets of the real numbers. The question was asked recently (and anonymously) whether it is possible for the halting problem H in BSS-computation to be BSS-reducible to a countable set.…

In a recent article, we introduced and studied a precise class of dynamical systems called solvable systems. These systems present a dynamic ruled by discontinuous ordinary differential equations with solvable right-hand terms and unique…

We study a generalization of the classical stable matching problem that allows for cardinal preferences (as opposed to ordinal) and fractional matchings (as opposed to integral). After observing that, in this cardinal setting, stable…