Related papers: A Subconvex Metaplectic Prime Geodesic Theorem and…
Let (X,L) be a polarized compact manifold, i.e. L is an ample line bundle over X and denote by H the infinite dimensional space of all positively curved Hermitian metrics on L equipped with the Mabuchi metric. In this short note we show,…
In this paper, we present two stepsize strategies for the extended Golden Ratio primal-dual algorithm (E-GRPDA) designed to address structured convex optimization problems in finite-dimensional real Hilbert spaces. The first rule features a…
An important yet challenging problem in numerical linear algebra is finding a principal submatrix with maximum determinant from a given symmetric positive semidefinite matrix. This problem arises in experimental design, statistics, and…
The Bishop-Gromov theorem is a comparison theorem of differential geometry that upperbounds the growth of volume of a geodesic ball in a curved space. For many spaces, this bound is far from tight. We identify a major reason the bound fails…
We give an asymptotic formula as $t\to+\infty$ for the number of common perpendiculars of length at most $t$ between two divergent geodesics or a divergent geodesic and a compact locally convex subset in negatively curved locally symmetric…
For hyperbolic differential operators $P$ with non-effectively hyperbolic double characteristics, we study the relationship between the Gevrey well-posedness threshold for strong well-posedness and the associated Hamilton map and flow. In…
We show that on a $\sigma$-finite measure preserving system $X = (X,\nu, T)$, the non-conventional ergodic averages $$ \mathbb{E}_{n \in [N]} \Lambda(n) f(T^n x) g(T^{P(n)} x)$$ converge pointwise almost everywhere for $f \in L^{p_1}(X)$,…
Geometric hitting set problems, in which we seek a smallest set of points that collectively hit a given set of ranges, are ubiquitous in computational geometry. Most often, the set is discrete and is given explicitly. We propose new…
Boob et al. [1] described an iterative peeling algorithm called Greedy++ for the Densest Subgraph Problem (DSG) and conjectured that it converges to an optimum solution. Chekuri, Quanrud, and Torres [2] extended the algorithm to general…
We consider the inverse problem of the simultaneous reconstruction of the dielectric permittivity and magnetic permeability functions of the Maxwell's system in 3D with limited boundary observations of the electric field. The theoretical…
The Gowers U^3 norm is one of a sequence of norms used in the study of arithmetic progressions. If G is an abelian group and A is a subset of G then the U^3(G) of the characteristic function 1_A is useful in the study of progressions of…
There are many examples of optimization problems whose associated polyhedra can be described much nicer, and with way less inequalities, by projections of higher dimensional polyhedra than this would be possible in the original space.…
This note complements a recent paper of Chatzakos, Harcos and Kaneko \cite{CHK}. We use a Dirichlet style Prime Geodesic Theorem to improve the error term estimate in loc. cit. at the cost of lowering the resolution. The proof relies on the…
Convex geometries are closure systems satisfying the anti-exchange axiom. Every finite convex geometry can be embedded into a convex geometry of finitely many points in an n-dimensional space equipped with a convex hull operator, by the…
For tensors of fixed order, we establish three types of upper bounds for the geometric rank in terms of the subrank. Firstly, we prove that, under a mild condition on the characteristic of the base field, the geometric rank of a tensor is…
In his recent research, the author improved the error term in the prime geodesic theorem for compact, even-dimensional, rank one locally symmetric spaces. It turned out that the obtained estimate $O(x^{2\rho-\frac{\rho}{n}}(\log x)^{-1})$…
We study first-passage percolation through related optimization problems over paths of restricted length. The path length variable is in duality with a shift of the weights. This puts into a convex duality framework old observations about…
We study $A$-hypergeometric systems $H_A(\beta)$ in the sense of Gelfand, Kapranov and Zelevinsky under two aspects: the structure of their holonomically dual system, and reducibility of their rank module. We prove first that rank-jumping…
Leray and G{\aa}rding have developed a multiplier technique for deriving a priori estimates for solutions to scalar hyperbolic equations in either the whole space or the torus. In particular, the arguments in Leray and G{\aa}rding's work…
We prove the convergence and ergodicity of a wide class of real and higher-dimensional continued fraction algorithms, including folded and $\alpha$-type variants of complex, quaternionic, octonionic, and Heisenberg continued fractions,…