Related papers: A generalization of the Newton-Puiseux algorithm f…
This work studies the combinatorial optimization problem of finding an optimal core tensor shape, also called multilinear rank, for a size-constrained Tucker decomposition. We give an algorithm with provable approximation guarantees for its…
A seminal technique of theoretical physics called Wick's theorem interprets the Gaussian matrix integral of the products of the trace of powers of Hermitian matrices as the number of labelled maps with a given degree sequence, sorted by…
Given a family of nodal curves, a semistable modification of it is another family made up of curves obtained by inserting chains of rational curves of any given length at certain nodes of certain curves of the original family. We give…
We generalize the Robinson-Schensted-Knuth algorithm to the insertion of two row arrays of multisets. This generalization leads to new enumerative results that have representation theoretic interpretations as decompositions of centralizer…
We develop a number of general techniques for comparing analytifications and tropicalizations of algebraic varieties. Our basic results include a projection formula for tropical multiplicities and a generalization of the Sturmfels-Tevelev…
Working over imperfect fields, we give a comprehensive classification of genus-one curves that are regular but not geometrically regular, extending the known case of geometrically reduced curves. The description is given intrinsically, in…
We use the geometry of the secant variety to an embedded smooth curve to prove some vanishing and regularity theorems for powers of ideal sheaves.
We describe a simple formalism for generating classes of quantum circuits that are classically efficiently simulatable and show that the efficient simulation of Clifford circuits (Gottesman-Knill theorem) and of matchgate circuits…
In this paper, we extend the analysis of random Kronecker graphs to multi-dimensional networks represented as tensors, enabling a more detailed and nuanced understanding of complex network structures. We decompose the adjacency tensor of…
We mechanize, in the proof assistant Isabelle, a proof of the axiom-scheme of Separation in generic extensions of models of set theory by using the fundamental theorems of forcing. We also formalize the satisfaction of the axioms of…
We introduce the notion of differential torsors, which allows the adaptation of constructions from algebraic geometry to differential Galois theory. Using these differential torsors, we set up a general framework for applying patching…
We define a derived enhancement of the hyperquot scheme (also known as nested Quot scheme), which classically parametrises flags of quotients of a perfect coherent sheaf on a projective scheme. We prove it is representable by a derived…
The exact solvability of several nuclear models with non-degenerate single-particle energies is outlined and leads to a generalization of integrable Richardson-Gaudin models, like the $su(2)$-based fermion pairing, to any simple Lie…
We point out the relevance of the Differential Galois Theory of linear differential equations for the exact semiclassical computations in path integrals in quantum mechanics. The main tool will be a necessary condition for complete…
For any odd $n$, we describe a smooth minimal (i.e. obtained by adding an irreducible hypersurface) compactification $\tilde S_n$ of the quasi-projective homogeneous variety $S_{n}=PGL(n+1)/SL(2)$ that parameterizes the rational normal…
Regularized factorization is proposed to simulate time evolution for quantum lattice systems. Transcending the Trotter decomposition, the resulting compact structure of the propagator indicates a high-order Baker-Campbell-Hausdorff series.…
We investigate the computational complexity of problems on toric ideals such as normal forms, Gr\"obner bases, and Graver bases. We show that all these problems are strongly NP-hard in the general case. Nonetheless, we can derive efficient…
In the long paper "Family Blowup formula, Admissible Graphs and the Enumeration of Singular Curves (I)" (appearing in JDG), the author solved the enumeration problem of nodal (or general singular) curve counting on algebraic surfaces by…
Conventional simulations of complex systems in the canonical ensemble suffer from the quasi-ergodicity problem. A simulation in generalized ensemble overcomes this difficulty by performing a random walk in potential energy space and other…
We develop the theory of costratification in the setting of relative tensor-triangular geometry, in the sense of Stevenson, providing a unified approach to classification results of Neeman and Benson--Iyengar--Krause, while laying the…