Related papers: A minimal pair in the generic degrees

We discuss the relative log minimal model theory for log surfaces in the analytic setting. More precisely, we show that the minimal model program, the abundance theorem, and the finite generation of log canonical rings hold for log pairs of…

We calculate the minimal degree for a class of finite complex reflection groups $G(p,p,q)$, for $p$ and $q$ primes and establish relationships between minimal degrees when these groups are taken in a direct product.

A generic computation of a subset $A$ of $\mathbb{N}$ is a computation which correctly computes most of the bits of $A$, but which potentially does not halt on all inputs. The motivation for this concept is derived from complexity theory,…

It is known that the $\Theta$-correspondence for a finite reductive dual pair is not one-to-one in general. In this paper, we propose two maximal one-to-one sub-relations $\underline\theta,\overline\theta$ of the $\Theta$-correspondences…

We obtain a complete classification of minimal simple unitary $W$-algebras.

For many common height functions, it is notoriously hard to compute the essential minimum. Nevertheless there are two classical methods, one giving lower bounds and the other giving upper bounds. In this paper, we show that the two methods…

A natural construction of the logarithmic extension of the M(2,p) minimal models is presented, which generalises our previous model [0708.0802] of percolation (p=3). Its key aspect is the replacement of the minimal model irreducible modules…

In this paper, we study the power and limitations of computing effectively generic sequences using effectively random oracles. Previously, it was known that every 2-random sequence computes a 1-generic sequence (as shown by Kautz) and every…

We initiate a study of varieties of minimal degree in weighted projective spaces. We call a weighted projective space $\mathbf{P}(w_0,\dots,w_n)$ divisible if $w_i \mid w_{i+1}$ for all $i$. We provide sharp bounds for when a non-degenerate…

The existence of the limiting pair correlation for angles between reciprocal geodesics on the modular surface is established. An explicit formula is provided, which captures geometric information about the length of reciprocal geodesics, as…

We formulate a conjecture on the behavior of the minimal free resolutions of sets of general points on arbitrary varieties embedded by complete linear series, in analogy with the well-known Minimal Resolution Conjecture for points in…

The idea of minimum distance, familiar from R <-> 1/R duality when the string target space is a circle, is analyzed for less trivial geometries. The particular geometry studied is that of a blown-up quotient singularity within a Calabi-Yau…

This paper shows that Mustata-Nakamura's conjecture holds for pairs consisting of a smooth surface and a multiideal with a real exponent over the base field of positive characteristic. As corollaries, we obtain the ascending chain condition…

We study pairs of finitely generated modules over a principal ideal domain and their corresponding matrix representations. We introduce equivalence relations for such pairs and determine invariants and canonical forms.

A set $I$ is said to be a universal indifferent set for $1$-genericity if for every $1$-generic $G$ and for all $X \subseteq I$, $G \Delta X$ is also $1$-generic. Miller showed that there is no infinite universal indifferent set for…

We prove generic differentiability in $P$-minimal theories, strengthening an earlier result of Kuijpers and Leenknegt. Using this, we prove Onshuus and Pillay's $P$-minimal analogue of Pillay's conjectures on o-minimal groups. Specifically,…

A $\Pi^{0}_{1}$ class $P$ is thin if every $\Pi^{0}_{1}$ subclass $Q$ of $P$ is the intersection of $P$ with some clopen set. In 1993, Cenzer, Downey, Jockusch and Shore initiated the study of Turing degrees of members of thin $\Pi^{0}_{1}$…

A virtual link may be defined as an equivalence class of diagrams, or alternatively as a stable equivalence class of links in thickened surfaces. We prove that a minimal crossing virtual link diagram has minimal genus across representatives…

We compare the degrees of enumerability and the closed Medvedev degrees and find that many situations occur. There are nonzero closed degrees that do not bound nonzero degrees of enumerability, there are nonzero degrees of enumerability…

We discuss the minimal model program for b-log varieties, which is a pair of a variety and a b-divisor, as a natural generalization of the minimal model program for ordinary log varieties. We show that the main theorems of the log MMP work…