Related papers: $\exists\mathbb{R}$-Completeness of Tensor Degener…
Let $\MP_d$ denote the space of polynomials $f: \C \to \C$ of degree $d\geq 2$, modulo conjugation by $\Aut(\C)$. Using properties of polynomial trees (as introduced in [DM, math.DS/0608759]), we show that if $f_n$ is a divergent sequence…
In this paper, we study the real hypersurfaces $M$ in $\mathbb C^2$ at points $p\in M$ of infinite type. The degeneracy of $M$ at $p$ is assumed to be the least possible, namely such that the Levi form vanishes to first order in the CR…
The distributional statistical framework replaces classical probability densities by distribution-kernel pairs $(T, \varphi)$, where $T$ is a tempered distribution and $\varphi$ is a rapidly decaying kernel. We develop the thesis that the…
We enumerate complex algebraic hypersurfaces in $P^n$, of a given (high) degree with one singular point of a given singularity type. Our approach is to compute the (co)homology classes of the corresponding equi-singular strata in the…
For a one-parameter degeneration of reduced compact complex analytic spaces of dimension $n$, we prove the invariance of the frontier Hodge numbers $h^{p,q}$ (that is, with $pq(n{-}p)(n{-}q)=0$) for the intersection cohomology of the fibers…
We explore applying a tensor completion approach to complete the DrugMatrix toxicogenomics dataset. Our hypothesis is that by preserving the 3-dimensional structure of the data, which comprises tissue, treatment, and transcriptomic…
Motivated by connections between algebraic complexity lower bounds and tensor decompositions, we investigate Koszul-Young flattenings, which are the main ingredient in recent lower bounds for matrix multiplication. Based on this tool we…
Barvinok introduced the symmetrized determinant ($\sdet$) as a \emph{non-commutative} analogue of the determinant. Intuitively, given a square matrix over an associative algebra, we can obtain the symmetrized determinant by averaging over…
We show that unlike machine learning classifiers, there are no complex boundary structures in the decision boundaries for well-trained deep models. However, we found that the complicated structures do appear in training but they vanish…
For a subvariety of a smooth projective variety, consider the family of smooth hypersurfaces of sufficiently large degree containing it, and take the quotient of the middle cohomology of the hypersurfaces by the cohomology of the ambient…
A fundamental problem in computational algebraic geometry is the computation of the resultant. A central question is when and how to compute it as the determinant of a matrix. whose elements are the coefficients of the input polynomials…
Let $\M$ be a von Neumann algebra acting on a Hilbert space $\H$, and $\N$ be a singular von Neumann subalgebra of $\M.$ If $\N\tensor\B(\K)$ is singular in $\M\tensor\B(\K)$ for any Hilbert space $\K$, we say $\N$ is \emph{completely…
The monodromy conjecture is an umbrella term for several conjectured relationships between poles of zeta functions, monodromy eigenvalues and roots of Bernstein-Sato polynomials in arithmetic geometry and singularity theory. Even the…
We show that a tensor product of irreducible, finite dimensional representations of a simple Lie algebra over a field of characteristic zero, determines the individual constituents uniquely. This is analogous to the uniqueness of prime…
The variety $ \mathrm{Sing}_{n, m} $ consists of all tuples $ X = (X_1,\ldots, X_m) $ of $ n\times n $ matrices such that every linear combination of $ X_1,\ldots, X_m $ is singular. Equivalently, $X\in\mathrm{Sing}_{n,m}$ if and only if…
We study uniqueness of solutions to degenerate parabolic problems, posed in bounded domains, where no boundary conditions are imposed. Under suitable assumptions on the operator, uniqueness is obtained for solutions that satisfy an…
We prove finite jet determination results for smooth CR embeddings which are of constant degeneracy, using the method of complete systems. As an application, we derive a reflection principle for mappings between a Levi-nondegenerate…
In a previous work [J. Chem. Phys. 155, 244111 (2021)], we found counterexamples to the fundamental Hohenberg-Kohn theorem from density-functional theory in finite-lattice systems represented by graphs. Here, we demonstrate that this only…
The tractability conjecture for finite domain Constraint Satisfaction Problems (CSPs) stated that such CSPs are solvable in polynomial time whenever there is no natural reduction, in some precise technical sense, from the 3-SAT problem;…
Efficient probability density estimation is a core challenge in statistical machine learning. Tensor-based probabilistic graph methods address interpretability and stability concerns encountered in neural network approaches. However, a…