arXiv research

We prove all knots can be transformed into a trefoil using special diagrams.

Magic braids can be made with leatherworking technique.

MAGIC-Flow generates and classifies medical images with interpretability.

Minimal triangulations for 229 hyperbolic census knots discovered.

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…

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.

Unified framework for imputation and prediction in healthcare time series.

3-manifolds are CR uniformized on spheres, proving a conjecture.

MAGIC method optimally estimates model predictions changes.

New criterion for bi-ordering free groups under automorphisms.

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…

Two multifidelity trust-region methods use low-fidelity models for efficient optimization.

Study character variety of a special 3-manifold, finding a polynomial formula.

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

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

In this note, we use Chern's magic form $Φ_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 $L_k$. Moreover, this equivalence implie…

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…

MAGIC uncovers disease heterogeneity across brain scales.

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

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

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 …

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,…

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

We propose an offline-online procedure for Fourier transform based option pricing. The method supports the acceleration of such essential tasks of mathematical finance as model calibration, real-time pricing, and, more generally, risk assessment and parameter risk estimation. We adapt the empirical magic point interpol…

Study of skateboard flips as continuous curves in $SO(3)$ group.

Nash's theorem proved with Günther's trick

Explains Conway's tangle trick and its mathematical origins.

Unified framework for gradient estimation in combinatorial spaces.

Geometric trick simplifies link homotopy and concordance.

Outlier based Robust Principal Component Analysis (RPCA) requires centering of the non-outliers. We show a "bias trick" that automatically centers these non-outliers. Using this bias trick we obtain the first RPCA algorithm that is optimal with respect to centering.

Baker showed that 10 of the 12 classes of Berge knots are obtained by surgery on the minimally twisted 5-chain link. In this article we enumerate all hyperbolic knots in S^3 obtained by surgery on the minimally twisted 5 chain link that realize the maximal known distances between slopes corresponding to exceptional (le…

The Gumbel-max trick and its extensions simplify sampling from categorical distributions in machine learning.

We obtain the classical Hanner inequalities by the Bellman function method. These inequalities give sharp estimates for the moduli of convexity of Lebesgue spaces. Easy ideas from differential geometry help us to find the Bellman function using neither "magic guesses" nor calculations.

A new gradient estimator for categorical distributions reduces bias and variance.

Establishes necessary and sufficient conditions for smooth triviality of Lie subalgebras and Lie ideals, and proves Moser's trick for foliations.

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

Retail Product Image Classification is an important Computer Vision and Machine Learning problem for building real world systems like self-checkout stores and automated retail execution evaluation. In this work, we present various tricks to increase accuracy of Deep Learning models on different types of retail product …

Triple-point Whitney trick classifies ornaments of 3-manifolds.

Alexander trick applied to homology spheres for manifold homeomorphisms.

Embolic volume of compact manifolds is defined in terms of Berger's embolic inequality. In this paper, we show a result of relating embolic volume to the first Betti number. The proof relies on Gromov's covering argument appeared in systolic geometry. Berger called this method covering trick. We exploit and present mor…

Expands Bredon's trick for applications in geometry and topology.

Bredon's trick helps extend local properties to global topological spaces.

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 …

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 …

We observe that gradients computed via the reparameterization trick are in direct correspondence with solutions of the transport equation in the formalism of optimal transport. We use this perspective to compute (approximate) pathwise gradients for probability distributions not directly amenable to the reparameterizati…

We introduce a family of pairwise stochastic gradient estimators for gradients of expectations, which are related to the log-derivative trick, but involve pairwise interactions between samples. The simplest example of our new estimator, dubbed the fundamental trick estimator, is shown to arise from either a) introducin…

The Gumbel trick is a method to sample from a discrete probability distribution, or to estimate its normalizing partition function. The method relies on repeatedly applying a random perturbation to the distribution in a particular way, each time solving for the most likely configuration. We derive an entire family of r…

An online reinforcement learning algorithm is anytime if it does not need to know in advance the horizon T of the experiment. A well-known technique to obtain an anytime algorithm from any non-anytime algorithm is the "Doubling Trick". In the context of adversarial or stochastic multi-armed bandits, the performance of …