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,695 papers · 148 categories

Trend · papers per month

20416181 · Jun 202619922001200920172026
48 results for magic formula

We give a computer free proof of the Deligne, Cohen and deMan formulas for the dimensions of the irreducible gg-modules appearing in the tensor powers of gg, where gg ranges over the exceptional complex simple Lie algebras. We give additional dimension formulas for the exceptional series, as well as uniform dimensio…

2001-07-04abs ↗pdf ↗

Researchers create coordinates for hyperbolic surfaces, proving a magic formula.

problem Constructing coordinates for hyperbolic structures on genus-2 surfaces.
method Developed Fenchel-Nielsen coordinates and Wolpert's magic formula analogues.
result Found Darboux charts for the Goldman symplectic form on branched hyperbolic structures.

By formulating N = 1, 2, 4, 8, D = 3, Yang-Mills with a single Lagrangian and single set of transformation rules, but with fields valued respectively in R,C,H,O, it was recently shown that tensoring left and right multiplets yields a Freudenthal-Rosenfeld-Tits magic square of D = 3 supergravities. This was subsequently…

2013-12-23abs ↗pdf ↗

A soap film is actually a thin solid fluid bounded by two surfaces of opposite orientation. It is natural to model the film using one polyhedron for each side. Two problems are to get the polyhedra for both sides to be in the same place without canceling each other out and to model triple junctions without introducing …

2004-01-03abs ↗pdf ↗

This work estimates edge weights of edge-reinforced random walks using observed data.

problem Statistical estimation of edge weights in edge-reinforced random walks.
method Proposes an estimator based on the generalized method of moments using the magic formula and hyperbolic Gaussian structure.
result Analyzes the sample complexity of the proposed estimator.

Minimal triangulations for 229 hyperbolic census knots discovered.

problem Finding minimal triangulations for hyperbolic census knots.
method Ideal triangulations of the magic manifold, low-complexity triangulations for partial fillings, sorting into families.
result Minimal triangulations for 229 hyperbolic census knots discovered, conjectured to be minimal for all 42 families.

We investigate nonintegrable Riemannian geometries modelled after certain symmetric spaces related to the Freudenthal-Tits Magic Square. The collection of four such structures found by Nurowski is extended by further eight. A focus is given to those admitting a compatible connection with completely skew torsion.

2008-10-12abs ↗pdf ↗

Unified framework for imputation and prediction in healthcare time series.

problem Time misalignment and data sparsity in healthcare time series.
method MAGIC (Multi-tAsk Gaussian Process for Imputation and Classification) using hierarchical multi-task Gaussian process and functional logistic regression.
result Superior predictive accuracy compared to existing methods in two healthcare applications.

We connect the algebraic geometry and representation theory associated to Freudenthal's magic square. We give unified geometric descriptions of several classes of orbit closures, describing their hyperplane sections and desingularizations, and interpreting them in terms of composition algebras. In particular, we show h…

1999-08-10abs ↗pdf ↗

Topological theory for qLDPC codes enables non-Clifford gates and magic state injection.

problem Fault-tolerant quantum computation in qLDPC codes with non-Clifford gates and magic state resources.
method Developed a topological theory using simplicial or CW complex structures and deformation retraction.
result Achieved non-Clifford gates and magic state injection in qLDPC codes with constant rate and polynomial distance.

For various series of complex semi-simple Lie algebras $\fg (t)$ equipped with irreducible representations V(t)V(t), we decompose the tensor powers of V(t)V(t) into irreducible factors in a uniform manner, using a tool we call {\it diagram induction}. In particular, we interpret the decompostion formulas of Deligne \cite{d…

2002-03-22abs ↗pdf ↗

In this note, we use Chern's magic form ΦkΦ_k in his famous proof of the Gauss-Bonnet theorem to define a mass for asymptotically flat manifolds. It turns out that the new defined mass is equivalent to the one that we introduced recently by using the Gauss-Bonnet-Chern curvature LkL_k. Moreover, this equivalence implie…

2015-10-11abs ↗pdf ↗

We consider a hyperbolic surface bundle over the circle with the smallest known volume among hyperbolic manifolds having 3 cusps, so called "the magic manifold". We compute the entropy function on the fiber face of the unit ball with respect to the Thurston norm, determine homology classes whose representatives are gen…

2008-12-25abs ↗pdf ↗

We study the magic manifold NN which is a hyperbolic and fibered 33-manifold. We give an explicit construction of a fiber FaF_a and its monodromy :FaFa:F_a \rightarrow F_a of the fibration associated to each fibered class aa of NN. Let δgδ_g (resp. δg+δ_g^+) be the minimal dilatation of pseudo-Anosovs (resp. pseudo-Ano…

2014-12-24abs ↗pdf ↗

The split version of the Freudenthal-Tits magic square stems from Lie theory and constructs a Lie algebra starting from two split composition algebras [3, 17, 18]. The geometries appearing in the second row are Severi-Brauer varieties [20]. We provide an easy uniform axiomatization of these geometries and related ones,…

2012-06-14abs ↗pdf ↗

The statistical complexity of quantum circuits is studied using Rademacher complexity.

problem Measuring the richness of quantum hypothesis spaces.
method Applying Rademacher complexity to quantum circuits, investigating dependencies on resources, depth, width, and input/output registers.
result Bounds on the capacity of quantum neural networks constrained by circuit depth, width, and resource measures.

New quantum code breaks distance barrier with transversal non-Clifford gates.

problem Breaking the sqrt(N) distance barrier for quantum LDPC codes.
method Combining three qLDPC codes, Freedman-Hastings mapping, and triple cup product.
result Achieves Ω(N^(2/3)) distance and Θ(N^(2/3)) dimension, enabling fault-tolerant magic state preparation.

Let M be a manifold and g a Lie algebra acting on M. Differential forms Omega(M) carry a natural action of Lie derivatives L(x) and contractions I(x) of fundamental vector fields for x \in g. Contractions (anti-) commute with each other, [I(x), I(y)]=0. Together with the de Rham differential, they satisfy the Cartan's …

2010-07-19abs ↗pdf ↗

By using two different invariants for the Rubik's Magic puzzle, one of metric type, the other of topological type, we can dramatically reduce the universe of constructible configurations of the puzzle. Finding the set of actually constructible shapes remains however a challenging task, that we tackle by first reducing …

2014-01-15abs ↗pdf ↗

Historically, games of all kinds have often been the subject of study in scientific works of Computer Science, including the field of machine learning. By using machine learning techniques and applying them to a game with defined rules or a structured dataset, it's possible to learn and improve on the already existing …

2018-10-08abs ↗pdf ↗

Natural gradient descent avoids the magic of model parametrization, leading to different optimization outcomes.

problem Understanding the impact of model parametrization on optimization and generalization in deep learning.
method Characterization of natural gradient flow in deep linear networks and nonlinear neural networks.
result Natural gradient descent fails to generalize in some cases, while gradient descent with the right architecture performs well.

This paper contains a generalization of the convex ideal case of the Thurston-Andreev theorem when the genus is greater than 1. The heart of the paper concerns taking formal angle data on a surface and ``conformally flowing'' this formal angle data to uniquely associated uniform angle data. This flow turns out to be th…

2000-02-17abs ↗pdf ↗

We propose studies of special Riemannian geometries with structure groups H1=SO(3)SO(5)H_1=SO(3)\subset SO(5), H2=SU(3)SO(8)H_2=SU(3)\subset SO(8), H3=Sp(3)SO(14)H_3=Sp(3)\subset SO(14) and H4=F4SO(26)H_4=F_4\subset SO(26) in respective dimensions 5, 8, 14 and 26. These geometries, have torsionless models with symmetry groups G1=SU(3)G_1=SU(3), $G_2=SU(3)\times SU(3)…

2006-03-28abs ↗pdf ↗

We give a complete description of exceptional surgeries on pretzel knots of type (2,p,p)(-2, p, p) with p5p \ge 5. It is known that such a knot admits a unique toroidal surgery yielding a toroidal manifold with a unique incompressible torus. By cutting along the torus, we obtain two connected components, one of which is a t…

2011-02-06abs ↗pdf ↗

Let δg,nδ_{g,n} be the minimal dilatation of pseudo-Anosovs defined on an orientable surface of genus gg with nn punctures. Tsai proved that for any fixed g2g \ge 2, the logarithm of the minimal dilatation logδg,n\log δ_{g,n} is on the order of lognn\frac{\log n}{n}. The main result of this paper is that if 2g+12g+1 is relativel…

2012-05-14abs ↗pdf ↗

Using nonlinear pde techniques, we construct a new family of globally smooth tt* structures. This includes tt* structures associated to the (orbifold) quantum cohomology of a finite number of complex projective spaces and weighted projective spaces. The existence of such "magical solutions" of the tt* equations, namely…

2010-10-10abs ↗pdf ↗

We discuss the local and global problems for the equivalence of geometric structures of an arbitrary order and, in later sections, attention is given to what really matters, namely the equivalence with respect to transformations belonging to a given pseudo-group of transformations. We first give attention to general pr…

2014-12-29abs ↗pdf ↗

To promote economic stability, finance should be studied as a hard science, where scientific methods apply. When a trading strategy is proposed, the underlying model should be transparent and defined robustly to allow other researchers to understand and examine it thoroughly. Like any hard sciences, results must be rep…

2018-08-23abs ↗pdf ↗

Principal component analysis (PCA) is a mainstay of modern data analysis - a black box that is widely used but (sometimes) poorly understood. The goal of this paper is to dispel the magic behind this black box. This manuscript focuses on building a solid intuition for how and why principal component analysis works. Thi…

2014-04-03abs ↗pdf ↗

The Sampled Gaussian Mechanism's noise level decreases with larger subsampling rates, improving privacy-utility trade-offs.

problem Improving privacy-utility trade-offs in differentially private stochastic optimization.
method Proof of a conjecture about the Sampled Gaussian Mechanism's noise level and subsampling rate relationship.
result A rigorous proof of the conjecture, completing the proof of Theorem 6.2 in the original paper.