Research
On-device research index

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.

168,978 papers · 148 categories

Trend · papers per month

0.3%0.6%0.9%1.3% · May 200119922001200920172026
22 results for diagonalisation

Extends method for solving certain hydrodynamic systems.

problem Solving non-diagonalisable integrable systems of hydrodynamic type.
method Generalised hodograph method applied to F-manifolds with compatible connections.
result Provides general solution under certain assumptions.

Smooth but not symplectic embeddings of rational balls in complex projective plane found.

problem Finding smooth embeddings of rational balls in complex projective plane that are not symplectic.
method Infinite family of rational homology balls, lattice embedding obstruction from Donaldson's diagonalisation theorem.
result No two examples may be embedded disjointly.

The paper studies symmetries and conservation laws of non-diagonalisable hydrodynamic systems.

problem Integrating non-diagonalisable hydrodynamic systems of partial differential equations.
method Analysis of gl-regular Nijenhuis operators, splitting Theorem for symmetries and conservation laws, relationship between symmetries and conservation laws.
result The system of partial differential equations is integrable in quadratures.

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…

2018-02-15abs ↗pdf ↗

The paper constrains families of smooth 4-manifolds using Seiberg-Witten invariants.

problem Understanding the topology of families of smooth 4-manifolds.
method Finite dimensional approximation of the Seiberg-Witten monopole map.
result Constructs examples of continuous Zp\mathbb{Z}_p-actions and shows non-smoothability.

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…

2015-03-10abs ↗pdf ↗

New integrable systems constructed for non-diagonal Killing tensors.

problem Constructing integrable Hamiltonian systems with quadratic momenta.
method Using Nijenhuis geometry and gl-regular Nijenhuis operators.
result Reproduces classical Stäckel construction and finds new systems for n≥3.

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 gαβ=0g_{αβ} = 0 for (α,β)S(α, β) \in S where S=(1,3),(1,4),(2,3),(2,4)S = {(1, 3), (1, 4), (2, 3), (2, 4)}. We call a coordinate system in which the metric takes this for…

2008-09-19abs ↗pdf ↗

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…

2014-05-11abs ↗pdf ↗

The slicing number of a knot, us(K)u_s(K), is the minimum number of crossing changes required to convert KK to a slice knot. This invariant is bounded above by the unknotting number and below by the slice genus gs(K)g_s(K). We show that for many knots, previous bounds on unknotting number obtained by Ozsvath and Szabo and b…

2008-02-15abs ↗pdf ↗

We provide a partial classification of the 3-strand pretzel knots K=P(p,q,r)K = P(p,q,r) with unknotting number one. Following the classification by Kobayashi and Scharlemann-Thompson for all parameters odd, we treat the remaining families with rr even. We discover that there are only four possible subfamilies which may satis…

2011-09-21abs ↗pdf ↗

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 …

2016-09-01abs ↗pdf ↗