Related papers: On the strong Sarkisov program
We prove that given two cut free nets of linear logic, by means of their relational interpretations one can: 1) first determine whether or not the net obtained by cutting the two nets is strongly normalizable 2) then (in case it is strongly…
We set up a general scheme to resum ladder diagrams for the quark-anti-quark potential in N=4 super-Yang-Mills theory, and do explicit calculations at the next-to-leading order. The results perfectly agree with string theory in AdS(5)xS(5)…
We consider dynamical systems $T: X \to X$ that are extensions of a factor $S: Y \to Y$ through a projection $\pi: X \to Y$ with shrinking fibers, i.e. such that $T$ is uniformly continuous along fibers $\pi^{-1}(y)$ and the diameter of…
We show that there is a restriction, or modification of the finite-variable fragments of First Order Logic in which a weak form of Craig's Interpolation Theorem holds, but a strong form of this theorem does not hold. Translating these…
Three dimensional continuous and discrete Fourier-like transforms, based on the three simple and four semisimple compact Lie groups of rank 3, are presented. For each simple Lie group, there are three families of special functions ($C$-,…
We prove that if a finite group scheme $G$ over a field $k$ has essential dimension one, then it embeds in $PGL_{2/k}$. We use this to give an explicit classification of all infinitesimal group schemes of essential dimension one over any…
A weakly infeasible semidefinite program (SDP) has no feasible solution, but it has approximate solutions whose constraint violation is arbitrarily small. These SDPs are ill-posed and numerically often unsolvable. They are also closely…
This is a survey on the recent fundamental paper by V.V. Shokurov on the existence of log flips.
We prove the termination of 4-fold log flips for klt pairs of Kodaira dimension $\kappa\ge 2$.
The Drinfeld-Sokolov construction of integrable hierarchies, as well as its generalizations, may be extended to the case of loop superalgebras. A sufficient condition on the algebraic data for the resulting hierarchy to be invariant under…
The failure of the the loop expansion and effective lagrangians in two dimensions, which traditionally hinges on a power counting argument is considered. We establish that the book keeping device for the loop expansion, a role played by…
We derive the low-energy effective theory on the BPS domain wall in 4D N=1 global SUSY theories in terms of the 3D superfields. Our derivation makes the preserved SUSY by the wall manifest and the procedure for integrating out the massive…
We study Sarkisov links initiated by the toric weighted blowup of a point in $\mathbb{P}^3$ or $\mathbb{P}^4$ using variation of GIT. We completely classify which of these initiate Sarkisov links and describe the links explicitly. Moreover,…
We show how a filtration of Delaunay complexes can be used to approximate the persistence diagram of the distance to a point set in $R^d$. Whereas the full Delaunay complex can be used to compute this persistence diagram exactly, it may…
We prove that stationary Yang$-$Mills fields in dimensions 5 belonging to the variational class of weak connections are smooth away from a closed singular set $S$ of vanishing 1-dimensional Hausdorff measure. Our proof is based on an…
We prove a new family of sharp $L^2(\mathbb S^{d-1})\to L^4(\mathbb R^d)$ Fourier extension inequalities from the unit sphere $\mathbb S^{d-1}\subset \mathbb R^d$, valid in arbitrary dimensions $d\geq 3$.
We prove that there exist four operations such that given any two strongly $2$-connected digraphs $H$ and $D$ where $H$ is a butterfly-minor of $D$, there exists a sequence $D_0,\dots, D_n$ where $D_0=H$, $D_n=D$ and for every $0\leq i\leq…
A simple sparse coding mechanism appears in the sensory systems of several organisms: to a coarse approximation, an input $x \in \R^d$ is mapped to much higher dimension $m \gg d$ by a random linear transformation, and is then sparsified by…
Dang et al. have given an algorithm that can find a Tarski fixed point in a $k$-dimensional lattice of width $n$ using $O(\log^{k} n)$ queries. Multiple authors have conjectured that this algorithm is optimal [Dang et al., Etessami et al.],…
Multidimensional Continued Fraction Algorithms are generalizations of the Euclid algorithm and find iteratively the gcd of two or more numbers. They are defined as linear applications on some subcone of $\mathbb{R}^d$. We consider…