Related papers: members of thin $\Pi_1^0$ classes and generic degr…
We study generic properties of topological groups in the sense of Baire category. First we investigate countably infinite (discrete) groups. We extend a classical result of B. H. Neumann, H. Simmons and A. Macintyre on algebraically closed…
We study an infinite class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. This generalizes a sequence of sparse polynomials which arises in a natural way as graph theoretic…
We prove that there exists a weak truth-table introimmune set in the class $\Pi^0_1$, settling the question left open in previous work of whether the known $\Delta^0_2$ existence result can be improved to $\Pi^0_1$. Since $\Sigma^0_1$ sets…
A class of graphs is nowhere dense if for every integer r there is a finite upper bound on the size of cliques that occur as (topological) r-minors. We observe that this tameness notion from algorithmic graph theory is essentially the…
We characterize the curves in $ P^3$ which are minimal in their biliaison class. Such curves are exactly the curves which do no admit an elementary descending biliaison. As a consequence we have that every curve in $P^3$ can be obtained…
We shall study minimal complex surfaces with $c^2 = 9$ and $\chi=5$ whose canonical classes are divisible by $3$ in the integral cohomology groups, where $c_1^2$ and $\chi$ denote the first Chern number of an algebraic surface and the Euler…
We show that every two-dimensional class of topological similarity, and hence every diagonal conjugacy class of pairs, is meager in the group of order preserving bijections of the rationals and in the group of automorphisms of the randomly…
For the notion of degree of categoricity, we study an analogous notion for punctual structures. We show that such notions coincide for non-$\Delta_{1}^{0}$-categorical injection structures, and construct an example of a…
For a $k$-uniform hypergraph (or simply $k$-graph) $F$, the codegree Tur\'{a}n density $\pi_{\mathrm{co}}(F)$ is the infimum over all $\alpha$ such that any $n$-vertex $k$-graph $H$ with every $(k-1)$-subset of $V(H)$ contained in at least…
A classical theorem of John Thompson on character degrees asserts that if the degree of every ordinary irreducible character of a finite group $G$ is 1 or divisible by a prime $p$, then $G$ has a normal $p$-complement. We obtain a…
We give a characterization of the strong degrees of categoricity of computable structures greater or equal to $\mathbf 0''$. They are precisely the \emph{treeable} degrees -- the least degrees of paths through computable trees -- that…
In this paper we study the existence of gradings on finite dimensional associative algebras. We prove that a connected algebra $A$ does not have a non-trivial grading if and only if $A$ is basic, its quiver has one vertex, and its group of…
On a space of stable maps, the psi classes are modified by subtracting certain boundary divisors. The top products of modified psi classes, usual psi classes, and classes pulled back along the evaluation maps are called twisted descendants;…
Suppose E/F is a field extension. We ask whether or not there exists an element of E whose characteristic polynomial has one or more zero coefficients in specified positions. We show that the answer is frequently ``no''. We also prove…
Combining results from Keller and Buchweitz, we describe the 1-periodic derived category of a finite dimensional algebra $A$ of finite global dimension as the stable category of maximal Cohen-Macaulay modules over some Gorenstein algebra…
Let $\pi$ be a set of primes such that $|\pi|\geqslant 2$ and $\pi$ differs from the set of all primes. Denote by $r$ the smallest prime which does not belong to $\pi$ and set $m=r$ if $r=2,3$ and $m=r-1$ if $r\geqslant 5$. We study the…
Let $G$ be a reductive group defined over an algebraically closed field of characteristic $0$ such that the Dynkin diagram of $G$ is the disjoint union of diagrams of types $G_{2}, F_{4}, E_{6}, E_{7}, E_{8}$. We show that the degree $3$…
A generic computation of a subset A of the natural numbers consists of a a computation that correctly computes most of the bits of A, and which never incorrectly computes any bits of A, but which does not necessarily give an answer for…
The codegree Tur\'an density $\pi_{\text{co}}(F)$ of a $k$-uniform hypergraph (or $k$-graph) $F$ is the infimum over all $d$ such that a copy of $F$ is contained in any sufficiently large $n$-vertex $k$-graph $G$ with the property that any…
For a group $G$ and a natural number $m$, a subset $A$ of $G$ is called $m$-thin if, for each finite subset $F$ of $G$, there exists a finite subset $K$ of $G$ such that $|Fg\cap A|\leqslant m$ for every $g\in G\setminus K$. We show that…