Related papers: A Direct Ultrametric Approach to Additive Complexi…
We prove a theorem which gives a bijection between the support $\tau$-tilting modules over a given finite-dimensional algebra $A$ and the support $\tau$-tilting modules over $A/I$, where $I$ is the ideal generated by the intersection of the…
Combining a modular approach to the $abc$ conjecture developed by the second author with the classical method of linear forms in logarithms, we obtain improved unconditional bounds for two classical problems. First, for Szpiro's conjecture…
A rational approximation by a ratio of polynomial functions is a flexible alternative to polynomial approximation. In particular, rational functions exhibit accurate estimations to nonsmooth and non- Lipschitz functions, where polynomial…
Section 10.4 of the 1998 Springer-Verlag book {\em Complexity and Real Computation}, by Blum, Cucker, Shub, and Smale, contains a particularly elegant proof of the Fundamental Theorem of Algebra: The central idea of the proof naturally…
From the generalized Riemann hypothesis for motivic L-functions, we derive an effective version of the Sato-Tate conjecture for an abelian variety A defined over a number field k with connected Sato-Tate group. By effective we mean that we…
We first study superpolynomial associated to triply-graded reduced colored HOMFLY-PT homology. We propose conjectures of congruent relations and cyclotomic expansion for it. We prove conjecture of $N=1$ for torus knot case, through which we…
The probability that a zero of a random real polynomial of increasing degree is real tends to zero. However, passing from polynomials to Laurent polynomials yields a surprising result: the probability that a root is real tends not to zero,…
We outline the proof of a conjecture of Kontsevich on the isomorphism between the group of polynomial symplectomorphisms in $2n$ variables and the group of automorphisms of the $n$-th Weyl algebra over complex numbers. Our proof uses…
The all pairs shortest path problem (APSP) is one of the foundational problems in computer science. For weighted dense graphs on $n$ vertices, no truly sub-cubic algorithms exist to compute APSP exactly even for undirected graphs. This is…
Root subgroup factorization is a refinement of triangular (or LDU) factorization. For a complex reductive Lie group, and a choice of reduced factorization of the longest Weyl group element, the forward map from root subgroup coordinates to…
Modulo a prime number, we define semi-primitive roots as the square of primitive roots. We present a method for calculating primitive roots from quadratic residues, including semi-primitive roots. We then present progressions that generate…
We introduce a new approach to isolate the real roots of a square-free polynomial $F=\sum_{i=0}^n A_i x^i$ with real coefficients. It is assumed that each coefficient of $F$ can be approximated to any specified error bound. The presented…
Using matrix model, Mironov and Morozov recently gave a formula which represents Kontsevich-Witten tau-function as a linear expansion of Schur Q-polynomials. In this paper, we will show directly that the Q-polynomial expansion in this…
We prove the real non-attractive fixed point conjecture for complex polynomial and rational harmonic functions. A harmonic function $f=h+\overline{g}$ is polynomial (rational) if both $h$ and $g$ are polynomials (rational functions) of…
Given a polynomial $p$, the degree of its Chebyshev's method $C_p$ is determined. If $p$ is cubic then the degree of $C_p$ is found to be $4,6$ or $7$ and we investigate the dynamics of $C_p$ in these cases. If a cubic polynomial $p$ is…
Let $\underline{\mathcal F}$ be a $\tau$-sheaf. Building on previous work of Drinfeld, Anderson, Taguchi, and Wan, B\"ockle and Pink \cite{bp1} develop a cohomology theory for $\underline{\mathcal F}$. In \cite{boc1} B\"ockle uses this…
Let $U/K$ be a smooth affine curve over a number field and let $L$ be an irreducible rank 3 $\overline{\mathbb Q}_{\ell}$-local system on $U$ with trivial determinant and infinite geometric monodromy around a cusp. Suppose further that $L$…
We consolidate two widely believed conjectures about tautologies -- no optimal proof system exists, and most require superpolynomial size proofs in any system -- into a $p$-isomorphism-invariant condition satisfied by all paddable…
The problem of finding the correct asymptotic rate of approximation by polynomial loops in dependence of the smoothness of the elements of a loop group seems not well-understood in general. For matrix Lie groups such as SU(N), it can be…
We compare dynamical and algebraic properties of semigroups of rational maps. In particular, we show a version of the Day-von Neumann's conjecture and give a partial positive answer to "Sushkievich's problem" for semigroups of rational…