Related papers: Comparing the degrees of enumerability and the clo…

We study structured optimization problems with polynomial objective function and polynomial equality constraints. The structure comes from a multi-grading on the polynomial ring in several variables. For fixed multi-degrees we determine the…

Let $n$-Medvedev's logic $\mathbf{ML}_n$ be the intuitionistic logic of Medvedev frames based on the non-empty subsets of a set of size $n$, which we call $n$-Medvedev frames. While these are tabular logics, after characterizing…

We introduce a "workable" notion of degree for non-homogeneous polynomial ideals and formulate and prove ideal theoretic B\'ezout Inequalities for the sum of two ideals in terms of this notion of degree and the degree of generators. We…

The structure of non-compactness of optimal Sobolev embeddings of $m$-th order into the class of Lebesgue spaces and into that of all rearrangement-invariant function spaces is quantitatively studied. Sharp two-sided estimates of Bernstein…

The notion of $\delta$-Novikov algebras was introduced recently as a generalization of Novikov and bicommutative algebras. It looks like $\delta$-Novikov algebras have a richer structure than Novikov algebras. So, unlike Novikov algebras,…

The main result of the paper is the classification of all (nonassociative) algebras of level two, i.e. such algebras that maximal chains of nontrivial degenerations starting at them have length two. During this classification we obtain an…

A new class of distances appropriate for measuring similarity relations between sequences, say one type of similarity per distance, is studied. We propose a new ``normalized information distance'', based on the noncomputable notion of…

We present two simple descriptions of the denominator vectors of the cluster variables of a cluster algebra of finite type, with respect to any initial cluster seed: one in terms of the compatibility degrees between almost positive roots…

While it is known that there is at most a polynomial separation between quantum query complexity and the polynomial degree for total functions, the precise relationship between the two is not clear for partial functions. In this paper, we…

It will be shown that every N-graded Lie algebra generated in degree 1 of type FP with entropy less or equal to 1 must be finite-dimensional (cf. Thm. A). As a consequence every Koszul Lie algebra with entropy less or equal to 1 must be…

In the literature, various types of points and meager sets whose complements are connected have been studied, such as colocally connected points, non-weak cut points/sets, non-block points/sets, shore points/sets, etc. We extend that study,…

There are several relations which may fall short of genuine identity, but which behave like identity in important respects. Such grades of discrimination have recently been the subject of much philosophical and technical discussion. This…

A computable structure $\mathcal{A}$ has degree of categoricity $\mathbf{d}$ if $\mathbf{d}$ is exactly the degree of difficulty of computing isomorphisms between isomorphic computable copies of $\mathcal{A}$. Fokina, Kalimullin, and Miller…

Let N be a minimal normal nonabelian subgroup of a finite group G. We will show that there exists a nontrivial irreducible character of N of degree at least 5 which is extendible to G. This result will be used to settle two open questions…

Let M be any closed, locally symmetric n-manifold (n>1) of nonpositive curvature. Assume that M has no locally Euclidean factors and no factors locally isometric to SL(3,R). Then for any closed Riemannian manifold N and any continuous map…

Let $D$ be a strongly connected digraphs on $n\ge 4$ vertices. A vertex $v$ of $D$ is noncritical, if the digraph $D-v$ is strongly connected. We prove, that if sum of the degrees of any two adjacent vertices of $D$ is at least $n+1$, then…

Two well studied invariants of a complex projective variety are the unit Euclidean distance degree and the generic Euclidean distance degree. These numbers give a measure of the algebraic complexity for "nearest" point problems of the…

We contribute to a recent research program which aims at revisiting the study of the complexity of word problems, a major area of research in combinatorial algebra, through the lens of the theory of computably enumerable equivalence…

Given closed possibly nonorientable surfaces $M,N$, we prove that if a map $f:M\to N$ has degree $d>0$, then $\chi(M)\le d\cdot\chi(N)$. We give all necessary comments on the definition and properties of geometric degree, which can be…

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…