We give a short elementary proof that a Khovanov-type link homology constructed from a diagonalisable Frobenius algebra is degenerate.
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Trend · papers per month
Geodesic flows with diagonalisable integrals are orthogonal.
Penrose limit results for specific 3-surfaces in space-time.
Extends method for solving certain hydrodynamic systems.
Smooth but not symplectic embeddings of rational balls in complex projective plane found.
The paper studies symmetries and conservation laws of non-diagonalisable hydrodynamic systems.
We wish to attack the problems that H.~Anciaux and K.~Panagiotidou posed in [1], for non-degenerate real hypersurfaces in indefinite complex projective space. We will slightly change these authors' point of view, obtaining cleaner equations for the almost contact metric structure. To make the theory meaningful, we cons…
We prove that for an algebraic curvature tensor on a pseudo-Euclidean space, the Jordan-Osserman condition implies the Rakić duality principle, and that the Osserman condition and the duality principle are equivalent in the diagonalisable case.
The paper constrains families of smooth 4-manifolds using Seiberg-Witten invariants.
Diagonalizes tautological classes of definite 4-manifolds.
We generalise theorems of Cochran-Lickorish and Owens-Strle to the case of links with more than one component. This enables the use of linking forms on double branched covers, Heegaard Floer correction terms, and Donaldson's diagonalisation theorem to complete the table of unlinking numbers for nonsplit prime links wit…
SOEM clusters time series data with improved accuracy.
This is the second of a series of papers dealing with an analog in Arakelov geometry of the holomorphic Lefschetz fixed point formula. We use the main result of the first paper to prove a residue formula "`a la Bott" for arithmetic characteristic classes living on arithmetic varieties acted upon by a diagonalisable tor…
New integrable systems constructed for non-diagonal Killing tensors.
It is shown that, in four dimensions, it is possible to introduce coordinates so that an analytic metric locally takes block diagonal form. i.e. one can find coordinates such that for where . We call a coordinate system in which the metric takes this for…
In his 2011 work, Maas has shown that the law of any time-reversible continuous-time Markov chain with finite state space evolves like a gradient flow of the relative entropy with respect to its stationary distribution. In this work we show the converse to the above by showing that if the relative law of a Markov chain…
The slicing number of a knot, , is the minimum number of crossing changes required to convert to a slice knot. This invariant is bounded above by the unknotting number and below by the slice genus . We show that for many knots, previous bounds on unknotting number obtained by Ozsvath and Szabo and b…
Algorithm finds ribbon disks for alternating knots, resolving sliceness for most prime knots.
We provide a partial classification of the 3-strand pretzel knots with unknotting number one. Following the classification by Kobayashi and Scharlemann-Thompson for all parameters odd, we treat the remaining families with even. We discover that there are only four possible subfamilies which may satis…
Study on signal recovery from low-rank matrix with sparse noise.
Sparse coding is a core building block in many data analysis and machine learning pipelines. Typically it is solved by relying on generic optimization techniques, that are optimal in the class of first-order methods for non-smooth, convex functions, such as the Iterative Soft Thresholding Algorithm and its accelerated …
Sparse coding is a core building block in many data analysis and machine learning pipelines. Typically it is solved by relying on generic optimization techniques, such as the Iterative Soft Thresholding Algorithm and its accelerated version (ISTA, FISTA). These methods are optimal in the class of first-order methods fo…