相关论文: Perfect sets of random reals

Let $0<\ell\in\mathbb{Z}$. The notion of an efficient dominating set or perfect code $S$ of a graph $G$ is generalized to that of an efficient dominating$\,^\ell$-set or perfect$^\ell$code, of the graph $G$, meaning that each vertex $v$ of…

Let $F$ be a number field with ring of integers $\Oc_F$ and $\Dc$ a division $F$-algebra with a maximal cyclic subfield $K$. We study rings occurring as quotients of a natural $\Oc_F$-order $\Lambda$ in $\Dc$ by two-sided ideals. We reduce…

\noindent A perfect dominating set in a graph $G=(V,E)$ is a subset $S \subseteq V$ such that each vertex in $V \setminus S$ has exactly one neighbor in $S$. A perfect coalition in $G$ consists of two disjoint sets of vertices $V_i$ and…

n infinite two-player zero-sum game with a Borel winning set, in which the opponent's actions are monitored eventually but not necessarily immediately after they are played, is determined. The proof relies on a representation of the game as…

If A is a set of nonnegative integers containing 0, then there is a unique nonempty set B of nonnegative integers such that every positive integer can be written in the form a+b, where a\in A and b\in B, in an even number of ways. We…

Let $A$ be an associative unital algebra, $B_k$ its successive quotients of lower central series and $N_k$ the successive quotients of ideals generated by lower central series. The geometric and algebraic aspects of $B_k$ and $N_k$ have…

A set $X \subseteq 2^\omega$ with positive measure contains a perfect subset. We study such perfect subsets from the viewpoint of computability and prove that these sets can have weak computational strength. Then we connect the existence of…

Let G be a simple algebraic group over the complex numbers containing a Borel subgroup B. Given a B-stable ideal I in the nilradical of the Lie algebra of B, we define natural numbers $m_1, m_2, ..., m_k$ which we call ideal exponents. We…

Green and Schroll give an easy criterion for a monomial algebra $A$ to be quasi-hereditary with respect to some partial order $\leq_A$. A natural follow-up question is under which conditions a monomial quasi-hereditary algebra $(A, \leq_A)$…

We show that if A is a linear order then Th(A) is either $\aleph_0$-categorical or Borel complete (in the sense of Friedman and Stanley). We generalize this; if A has countably many unary predicates attached, then Th(A) is…

The fractional perfect b-matching polytope of an undirected graph G is the polytope of all assignments of nonnegative real numbers to the edges of G such that the sum of the numbers over all edges incident to any vertex v is a prescribed…

We examine those matrix rings whose entries lie in periodic rings equipped with some additional properties. Specifically, we prove that the famous Diesl's question whether or not $R$ being nil-clean implies that $\mathbb{M}_n(R)$ is…

We consider sets of positive integers containing no sum of two elements in the set and also no product of two elements. We show that the upper density of such a set is strictly smaller than 1/2 and that this is best possible. Further, we…

Using an extension of the abundancy index to imaginary quadratic rings with unique factorization, we define what we call $n$-powerfully perfect numbers in these rings. This definition serves to extend the concept of perfect numbers that…

Perfect Gabriel filters of right ideals and their corresponding right rings of quotients have the desirable feature that every module of quotients is determined solely by the right ring of quotients. On the other hand, symmetric rings of…

We study word structures of the form $(D,<,P)$ where $D$ is either $\mathbb{N}$ or $\mathbb{Z}$, $<$ is the natural linear ordering on $D$ and $P\subseteq D$ is a predicate on $D$. In particular we show: (a) The set of recursive…

We consider some natural sets of real numbers arising in ergodic theory and show that they are, respectively, complete in the classes $\mathcal D_2 (\mathbf\Pi^0_3)$ and $\mathcal D_\omega (\mathbf \Pi^0_3)$, that is, the class of sets…

This is a continuation of the paper [J. Symb. Log. 87 (2022), 1065--1092]. For an ideal $\mathcal{I}$ on $\omega$ we denote $\mathcal{D}_{\mathcal{I}}=\{f\in\omega^\omega: f^{-1}[\{n\}]\in\mathcal{I} \text{ for every $n\in \omega$}\}$ and…

It is proved that the definition of an algebraic set of type ${\sf A}$ (a notion related to the multidimensional Hamburger moment problem) does not depend on the choice of a polynomial describing the algebraic set in question and that an…

We investigate the truth-table degrees of (co-)c.e.\ sets, in particular, sets of random strings. It is known that the set of random strings with respect to any universal prefix-free machine is Turing complete, but that truth-table…