相关论文: Rigid many-one degrees contain infinite antichains…

We consider the question "Is every nonzero generic degree a density-1-bounding generic degree?" By previous results \cite{I2} either resolution of this question would answer an open question concerning the structure of the generic degrees:…

We enumerate a necessary condition for the existence of infinitely many geometrically distinct, non-constant, prime closed geodesics on an arbitrary closed Riemannian manifold $M$. That is, we show that any Riemannian metric on $M$ admits…

In this paper, we prove the first-order convergence law for the uniform attachment random graph with almost all vertices having the same degree. In the considered model, vertices and edges are introduced recursively: at time $m+1$ we start…

We study the degree spectra and reverse-mathematical applications of computably enumerable and co-computably enumerable partial orders. We formulate versions of the chain/antichain principle and ascending/descending sequence principle for…

A graph is called $d$-rigid if there exists a generic embedding of its vertex set into $\mathbb{R}^d$ such that every continuous motion of the vertices that preserves the lengths of all edges actually preserves the distances between all…

We study the existence and the distribution of "long" chains in the Weihrauch degrees, mostly focusing on chains with uncountable cofinality. We characterize when such chains have an upper bound and prove that there are no cofinal chains…

We show that for any irrational number $\a$ and a sequence of integers $\{m_l\}_{l\in \N}$ such that $\displaystyle{\lim_{l\to \infty} \norm{m_l \a} = 0}$, there exists a continuous measure $\mu$ on the circle such that…

Some properties of $m$-density points and density-degree functions are studied. Moreover the following main results are provided: \vskip2mm \begin{itemize} \item {\it Let $\lambda$ be a continuous differential form of degree $h$ in…

In this paper we consider big Ramsey degrees of finite chains in countable ordinals. We prove that a countable ordinal has finite big Ramsey degrees if and only if it is smaller than $\omega^\omega$. Big Ramsey degrees of finite chains in…

We study rigidity properties of linearly ordered sets (chains) under automorphisms, order-embeddings, epimorphisms, and endomorphisms. We focus on two main cases, dense subchains of the real numbers, and uncountable dense chains of higher…

The Borodin--Kostochka conjecture states that every graph $G$ with maximum degree $\Delta(G)\ge 9$ satisfies $\chi(G)\le \max\{\omega(G),\Delta(G)-1\}$. In this paper, we verify this conjecture for graphs with sufficiently large maximum…

One of the cornerstones of extremal graph theory is a result of F\"uredi, later reproved and given due prominence by Alon, Krivelevich and Sudakov, saying that if $H$ is a bipartite graph with maximum degree $r$ on one side, then there is a…

We show that, in many situations, a homeomorphism $f$ of a manifold $M$ may be recovered from the (marked) isomorphism class of a finitely generated group of homeomorphisms containing $f$. As an application, we relate the notions of {\em…

Let $(G_n(x))_{n=0}^\infty$ be a $d$-th order linear recurrence sequence having polynomial characteristic roots, one of which has degree strictly greater than the others. Moreover, let $m\geq 2$ be a given integer. We ask for…

We continue the study of the theories of Baldwin-Shi hypergraphs from $[5]$. Restricting our attention to when the rank $\delta$ is rational valued, we show that each countable model of the theory of a given Baldwin-Shi hypergraph is…

In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…

By using the structure and some properties of extraspecial and generalized/almost extraspecial $p$-groups, we explicitly determine the number of elements of specific orders in such groups. As a consequence, one may find the number of cyclic…

We develop the theory of cryptographic nondeterministic-secure pseudorandomness beyond the point reached by Rudich's original work (Rudich 1997), and apply it to draw new consequences in average-case complexity and proof complexity.…

We show that the big Ramsey degrees of every countable universal $u$-uniform $\omega$-edge-labeled hypergraph are infinite for every $u\geq 2$. Together with a recent result of Braunfeld, Chodounsk\'y, de Rancourt, Hubi\v{c}ka, Kawach, and…

We extend results of Videla and Fukuzaki to define algebraic integers in large classes of infinite algebraic extensions of Q and use these definitions for some of the fields to show the first-order undecidability. We also obtain a…