English
Related papers

Related papers: Dedekind Zeta Zeroes and Faster Complex Dimension …

200 papers

We continue the study of counting complexity begun in [Buergisser, Cucker 04] and [Buergisser, Cucker, Lotz 05] by proving upper and lower bounds on the complexity of computing the Hilbert polynomial of a homogeneous ideal. We show that the…

Symbolic Computation · Computer Science 2007-05-23 Peter Buergisser , Martin Lotz

In four dimensions complexified General Relativity (GR) can be non-trivially deformed: There exists an (infinite-parameter) set of modifications all having the same count of degrees of freedom. It is trivial to impose reality conditions…

General Relativity and Quantum Cosmology · Physics 2021-03-22 Kirill Krasnov , Ermis Mitsou

Many high-dimensional uncertainty quantification problems are solved by polynomial dimensional decomposition (PDD), which represents Fourier-like series expansion in terms of random orthonormal polynomials with increasing dimensions. This…

Numerical Analysis · Mathematics 2018-04-06 Sharif Rahman

We consider the complexity of counting homomorphisms from an $r$-uniform hypergraph $G$ to a symmetric $r$-ary relation $H$. We give a dichotomy theorem for $r>2$, showing for which $H$ this problem is in FP and for which $H$ it is…

Computational Complexity · Computer Science 2010-01-04 Martin Dyer , Leslie Ann Goldberg , Mark Jerrum

In Part I of the present series of papers, we adumbrate our idea of Riemannian geometry to higher order in the infinitesimals and derive expressions for the appropriate generalizations of parallel transport and the Riemannian curvature…

Differential Geometry · Mathematics 2024-06-12 William Bies

Here we examine some connections between the notions of generalized arithmetic means, geodesics, Lagrange-Hamilton dynamics and Bregman divergences. In a previous paper we developed a predictive interpretation of generalized arithmetic…

Optimization and Control · Mathematics 2020-07-31 Henryk Gzyl

The prime numbers and the non-trivial zeros of the Riemann zeta function are globally linked by the explicit formula of analytic number theory. Whether they share a hidden, scale-by-scale geometric symmetry has remained unexplored. We…

General Mathematics · Mathematics 2026-05-26 Zhengqiang Li

General factors are a generalization of matchings. Given a graph $G$ with a set $\pi(v)$ of feasible degrees, called a degree constraint, for each vertex $v$ of $G$, the general factor problem is to find a (spanning) subgraph $F$ of $G$…

Discrete Mathematics · Computer Science 2024-05-24 Shuai Shao , Stanislav Živný

In this work, we propose to study noncommutative geometry using the language of categories of sheaves of algebras with polynomial identities and their properties, introducing new (graded) noncommutative geometries. These include, for…

Algebraic Geometry · Mathematics 2026-01-30 Lucio Centrone , Maurício Corrêa

The Riemann Hypothesis states that the Riemann zeta function $\zeta(z)$ admits a set of ``non-trivial'' zeros that are complex numbers supposed to have real part $1/2$. Their distribution on the complex plane is thought to be the key to…

General Relativity and Quantum Cosmology · Physics 2022-01-03 Fabrizio Tamburini , Ignazio Licata

The statement of the Riemann hypothesis makes sense for all global fields, not just the rational numbers. For function fields, it has a natural restatement in terms of the associated curve. Weil's work on the Riemann hypothesis for curves…

History and Overview · Mathematics 2021-01-19 James Milne

Representing images and videos with Symmetric Positive Definite (SPD) matrices, and considering the Riemannian geometry of the resulting space, has been shown to yield high discriminative power in many visual recognition tasks.…

Computer Vision and Pattern Recognition · Computer Science 2016-05-23 Mehrtash Harandi , Mathieu Salzmann , Richard Hartley

Let $f$ be a primitive positive definite integral binary quadratic form of discriminant $-D$ and let $\pi_f(x)$ be the number of primes up to $x$ which are represented by $f$. We prove several types of upper bounds for $\pi_f(x)$ within a…

Number Theory · Mathematics 2021-07-12 Asif Zaman

The symmetries described by Pin groups are the result of combining a finite number of discrete reflections in (hyper)planes. The current work shows how an analysis using geometric algebra provides a picture complementary to that of the…

Mathematical Physics · Physics 2025-10-16 Martin Roelfs , Steven De Keninck

In part I we reduced the arithmetic (characteristic zero) version of the P \not \subseteq NP conjecture to the problem of showing that a variety associated with the complexity class NP cannot be embedded in the variety associated the…

Computational Complexity · Computer Science 2007-05-23 Ketan D Mulmuley , Milind Sohoni

We study criteria for a ring - or more generally, for a small category - to be Gorenstein and for a module over it to be of finite projective dimension. The goal is to unify the universal coefficient theorems found in the literature and to…

K-Theory and Homology · Mathematics 2020-07-27 Ivo Dell'Ambrogio , Greg Stevenson , Jan Stovicek

Inspired by a result of Soundararajan, assuming the Riemann hypothesis (RH), we prove a new inequality for the logarithm of the modulus of the Riemann zeta-function on the critical line in terms of a Dirichlet polynomial over primes and…

Number Theory · Mathematics 2024-03-27 Emanuel Carneiro , Micah B. Milinovich

There is a family of seventh-degree polynomials $H$ whose members possess the symmetries of a simple group of order 168. This group has an elegant action on the complex projective plane. Developing some of the action's rich algebraic and…

Dynamical Systems · Mathematics 2007-05-23 Scott Crass

We have recently solved the inverse spectral problem for integrable PDEs in arbitrary dimensions arising as commutation of multidimensional vector fields depending on a spectral parameter $\lambda$. The associated inverse problem, in…

Exactly Solvable and Integrable Systems · Physics 2015-05-20 S. V. Manakov , P. M. Santini

A perfect matching in an undirected graph $G=(V,E)$ is a set of vertex disjoint edges from $E$ that include all vertices in $V$. The perfect matching problem is to decide if $G$ has such a matching. Recently Rothvo{\ss} proved the striking…

Discrete Mathematics · Computer Science 2018-04-26 David Avis , David Bremner , Hans Raj Tiwary , Osamu Watanabe
‹ Prev 1 8 9 10 Next ›