相关论文: A proof of the Brill-Noether method from scratch

In gravitational microlensing formalism and for modeling binary light curves, the key step is solving the binary lens equation. Currently, a combination of the Newton's and Laguerre's methods which was first introduced by Skowron \& Gould…

$\bar\partial$-extension of the matrix Riemann-Hilbert method is used to study asymptotics of the polynomials $P_n(z)$ satisfying orthogonality relations \[ \int_{-1}^1 x^lP_n(x)\frac{\rho(x)dx}{\sqrt{1-x^2}}=0, \quad l\in\{0,\ldots,n-1\},…

Nonlinear analysis has played a prominent role in the recent developments in geometry and topology. The study of the Yang-Mills equation and its cousins gave rise to the Donaldson invariants and more recently, the Seiberg-Witten invariants.…

Hilbert's program was an ambitious and wide-ranging project in the philosophy and foundations of mathematics. In order to "dispose of the foundational questions in mathematics once and for all, "Hilbert proposed a two-pronged approach in…

A Brill-Noether locus is a subscheme of the moduli of bundles E over a curve C defined by requiring E to have a given number of sections, or homomorphisms from another bundle. There are a number of different types, that can be treated by…

We generalize the celebrated results of Bernhard Riemann and Gaston Darboux: we give necessary and sufficient conditions for a bilinear form to be flat. More precisely, we give explicit necessary and sufficient conditions for a tensor field…

Several applications in optimization, image, and signal processing deal with data that belong to the Stiefel manifold St(n,p), that is, the set of n-by-p matrices with orthonormal columns. Some applications, like the Riemannian center of…

In this work we propose a discretisation method for the Reissner--Mindlin plate bending problem in primitive variables that supports general polygonal meshes and arbitrary order. The method is inspired by a two-dimensional discrete de Rham…

Many hard combinatorial problems can be modeled by a system of polynomial equations. N. Alon coined the term polynomial method to describe the use of nonlinear polynomials when solving combinatorial problems. We continue the exploration of…

We consider the leapfrog algorithm by Noakes for computing geodesics on Riemannian manifolds. The main idea behind this algorithm is to subdivide the original endpoint geodesic problem into several local problems, for which the endpoint…

Combinatorial methods (or methods of elementary transformations) came to group theory from low-dimensional topology in the beginning of the century. Soon after that, combinatorial group theory became an independent area with its own…

Retraction-free approaches offer attractive low-cost alternatives to Riemannian methods on the Stiefel manifold, but they are often first-order, which may limit the efficiency under high-accuracy requirements. To this end, we propose a…

We provide a new foundation for combinatorial commutative algebra and Stanley-Reisner theory using the partition complex introduced in [Adi18]. One of the main advantages is that it is entirely self-contained, using only a minimal knowledge…

The mathematical foundations of relativistic quantum mechanics is largely based upon the discovery of the Pauli and Dirac matrices. An algebra which lies at an even more fundamental level is the geometric Clifford algebra with metric…

Noether's theorem, which connects continuous symmetries to exact conservation laws, remains one of the most fundamental principles in physics and dynamical systems. In this work, we draw a conceptual parallel between two paradigms: the…

This review is dedicated to some modern applications of the remarkable paper written in 1918 by E. Noether. On a single paper, Noether discovered the crucial relation between symmetries and conserved charges as well as the impact of gauge…

We derive the Lie and the Noether conditions for the equations of motion of a dynamical system in a $n-$dimensional Riemannian space. We solve these conditions in the sense that we express the symmetry generating vectors in terms of the…

Constructing $r$-th nonresidue over a finite field is a fundamental computational problem. A related problem is to construct an irreducible polynomial of degree $r^e$ (where $r$ is a prime) over a given finite field $\mathbb{F}_q$ of…

We describe a method to compute the norm on the cotangent space to the moduli space of Riemann surfaces associated to the Finsler Teichm\"uller metric. Our method involves computing the periods of abelian double covers and is easy to…

A strong link between information geometry and algebraic statistics is made by investigating statistical manifolds which are algebraic varieties. In particular it it shown how first and second order efficient estimators can be constructed,…