Related papers: Dedekind Zeta Zeroes and Faster Complex Dimension …
Class groups of real quadratic fields represent fundamental structures in algebraic number theory with significant computational implications. While Stark's conjecture establishes theoretical connections between special units and class…
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…
We investigate two-dimensional higher derivative gravitational theories in a Riemann-Cartan framework and obtain the most general static black hole solutions in conformal coordinates. We also consider the hamiltonian formulation of the…
For both the edge deletion heuristic and the maximum-degree greedy heuristic, we study the problem of recognizing those graphs for which that heuristic can approximate the size of a minimum vertex cover within a constant factor of r, where…
Beginning from the resolution of Dirichlet L function, using the inner product formula of infinite-dimensional vectors in the complex space, the author proved the world's baffling problem--Generalized Riemann hypothesis.
This paper proposes a generalized framework with joint normalization which learns lower-dimensional subspaces with maximum discriminative power by making use of the Riemannian geometry. In particular, we model the similarity/dissimilarity…
In this paper we present a novel arbitrary-order discrete de Rham (DDR) complex on general polyhedral meshes based on the decomposition of polynomial spaces into ranges of vector calculus operators and complements linked to the spaces in…
Core decomposition is a classic technique for discovering densely connected regions in a graph with large range of applications. Formally, a $k$-core is a maximal subgraph where each vertex has at least $k$ neighbors. A natural extension of…
We shall describe a simple generalization of commutative rings. The category GR of such "rings", contains the ordinary commutative rings (fully faithfully), but also the "integers" and "residue field" at a real or complex place of a field ;…
Recent advances in large-margin classification of data residing in general metric spaces (rather than Hilbert spaces) enable classification under various natural metrics, such as string edit and earthmover distance. A general framework…
Consider a system of polynomials in many variables over the ring of integers of a number field $K$. We prove an asymptotic formula for the number of integral zeros of this system in homogeneously expanding boxes. As a consequence, any…
Hypertree decompositions of hypergraphs are a generalization of tree decompositions of graphs. The corresponding hypertree-width is a measure for the cyclicity and therefore tractability of the encoded computation problem. Many NP-hard…
Dimensional reductions of various higher dimensional (super)gravity theories lead to effectively two-dimensional field theories described by gravity coupled G/H nonlinear sigma-models. We show that a new set of complexified variables can be…
When constructing general relativity (GR), Einstein required 4D general covariance. In contrast, we derive GR (in the compact, without boundary case) as a theory of evolving 3-dimensional conformal Riemannian geometries obtained by imposing…
Riemann-Hilbert problems are jump problems for holomorphic functions along given interfaces. They arise in various contexts, e.g. in the asymptotic study of certain nonlinear partial differential equations and in the asymptotic analysis of…
It is well-known that Klein's lectures on the icosahedron and the solution of equations of fifth degree is one of the most important and influential books of 19th-century mathematics. In the present paper, we will give the complex…
We investigate a dynamical basis for the Riemann hypothesis (RH) that the non-trivial zeros of the Riemann zeta function lie on the critical line x = 1/2. In the process we graphically explore, in as rich a way as possible, the diversity of…
A compact subset $K$ of the complex plane $\C$ is a set of polynomial (respectively rational) approximation if $P(K)=A(K)$ (respectively $R(K)=A(K)$), where $P(K)$ (respectively $R(K)$) is the family of functions on $K$ which are uniform…
A new version of the Graeffe algorithm for finding all the roots of univariate complex polynomials is proposed. It is obtained from the classical algorithm by a process analogous to renormalization of dynamical systems. This iteration is…
We present new finite elements for solving the Riesz maps of the de Rham complex on triangular and tetrahedral meshes at high order. The finite elements discretize the same spaces as usual, but with different basis functions, so that the…