Related papers: On the existence of a strong minimal pair

Given $F= \mathbb{F}_{p^{t}}$, a field with $p^t$ elements, where $p $ is a prime power, $t\geq 7$, $n$ are positive integers and $f=f_1/f_2$ is a rational function, where $f_1, f_2$ are relatively prime, irreducible polynomials with…

In this article we prove that for a large class of 2-dimensional minimal cones (including almost all 2-dimensional minimal cones that we know), the almost orthogonal union of any two of them is still a minimal cone. Comparing to existing…

In the proposed matrix primes, through which one can readily generate a sequence of primes. The paper also proposes a number of theorems proved by which an infinite number of prime numbers twins

In this paper, we show that the subadditive dual of a feasible conic mixed-integer program (MIP) is a strong dual whenever it is feasible. Moreover, we show that this dual feasibility condition is equivalent to feasibility of the conic dual…

We prove that nine-dimensional exceptional quotient singularities exist.

In this paper, we introduce the enough $g$-pairs property for a principal coefficients cluster algebra, which can be understood as a strong version of the sign-coherence of the $G$-matrices. Then we prove that any skew-symmetrizable…

We use reduction maps to study the minimal model program. Our main result is that the existence of a good minimal model for a klt pair $(X,\Delta)$ can be detected on the base of the $(K_{X}+\Delta)$-trivial reduction map. Thus we show that…

We prove that the abundance conjecture for non-uniruled klt pairs in dimension $n$ implies the abundance conjecture for uniruled klt pairs in dimension $n$, assuming the Minimal Model Program in lower dimensions.

We give an algebraic approach to the study of Hitchin pairs and prove the tensor product theorem for Higgs semistable Hitchin pairs over smooth projective curves defined over algebraically closed fields $k$ of characteristic $0$ and…

We introduce adequate concepts of expansion of a digraph to obtain a sequential construction of minimal strong digraphs. We characterize the class of minimal strong digraphs whose expansion preserves the property of minimality. We prove…

In this note we prove new cases of the Mumford-Tate conjecture by extending a theorem of Richard Pink for abelian varieties without nontrivial endomorphisms and with bad semistable reduction. We use quadratic pairs introduced by…

We find an abundance of Cremer Julia sets of an arbitrarily high computational complexity.

We prove the existence of $n$-complements for pairs with DCC coefficients and the ACC for minimal log discrepancies of exceptional singularities. In order to prove these results, we develop the theory of complements for real coefficients.…

In this paper, we prove: Let A be a nonnegative primitive tensor with order m and dimension n. Then its primitive degree R(A)\leq (n-1)^2+1, and the upper bound is sharp. This confirms a conjecture of Shao [7].

Helmke et al. have recently given a formula for the number of reachable pairs of matrices over a finite field. We give a new and elementary proof of the same formula by solving the equivalent problem of determining the number of so called…

For an integer $k\ge2$, a tuple of $k$ positive integers $(M_i)_{i=1}^{k}$ is called an amicable $k$-tuple if the equation \[ \sigma(M_1)=\cdots=\sigma(M_k)=M_1+\cdots+M_k \] holds. This is a generalization of amicable pairs. An amicable…

We construct an increasing $\omega$-sequence $(a_n)$ of Turing degrees which forms an initial segment of the Turing degrees, and such that each~$a_{n+1}$ is diagonally noncomputable relative to $a_n$. It follows that the~$\mathsf{DNR}$…

The Turing degree of a real measures the computational difficulty of producing its binary expansion. Since Turing degrees are tailsets, it follows from Kolmogorov's 0-1 law that for any property which may or may not be satisfied by any…

In this note, we prove that there exist infinite dimensional excellent rings.

Liu and Ma [J. Combin. Theory Ser. B, 2018] conjectured that every $2$-connected non-bipartite graph with minimum degree at least $k+1$ contains $\lceil k/2\rceil $ cycles with consecutive odd lengths. In particular, they showed that this…