English
Related papers

Related papers: Bergman-Szeg\H{o} asymptotic formulas and the stri…

200 papers

A telescopic curve is a certain algebraic curve defined by $m-1$ equations in the affine space of dimension $m$, which can be a hyperelliptic curve and an $(n,s)$ curve as a special case. We extend the addition formulae for sigma functions…

Algebraic Geometry · Mathematics 2013-06-20 Takanori Ayano , Atsushi Nakayashiki

The Spectral Problem is to describe possible spectra $\sigma (A_j)$ for an irreducible $n$-tuple of Hermitian operators s.t. $A_1+...+A_n$ is a scalar operator. In case when $m_j= | \sigma (A_j)|$ are finite and a rooted tree ${\rm…

Representation Theory · Mathematics 2009-04-07 Stanislav Popovych

We consider weighted harmonic Bergman spaces on upper half-space with weights depending only on the vertical coordinate. In these settings, we give full asymptotic expansion of weighted harmonic Bergman kernel as well as full asymptotic…

Complex Variables · Mathematics 2023-12-15 Jaroslav Bradík

Let $G$ and $H$ be two simple graphs and let $G*H$ denotes the graph theoretical product of $G$ by $H$. In this paper we provide some results on graded Betti numbers, Castelnuovo-Mumford regularity, projective dimension, $h$-vector, and…

Commutative Algebra · Mathematics 2011-01-10 Amir Mousivand

We consider multi-variable sigma function of a genus $g$ hyperelliptic curve as a function of two group of variables -jacobian variables and parameters of the curve. In the theta-functional representation of sigma-function, the second group…

Exactly Solvable and Integrable Systems · Physics 2018-10-29 Victor Buchstaber , Victor Enolski , Dmitry Leykin

Edge-contraction operations form an effective tool in various graph enumeration problems, such as counting Grothendieck's dessins d'enfants and simple and double Hurwitz numbers. These counting problems can be solved by a mechanism known as…

Algebraic Geometry · Mathematics 2019-08-16 Olivia Dumitrescu , Motohico Mulase

In this work we study the method of Bregman projections for deterministic and stochastic convex feasibility problems with three types of control sequences for the selection of sets during the algorithmic procedure: greedy, random, and…

Optimization and Control · Mathematics 2021-01-06 Vladimir Kostic , Saverio Salzo

This paper provides an overview of results, concerning longest or heaviest paths, in the area of random directed graphs on the integers along with some extensions. We study first-order asymptotics of heaviest paths allowing weights both on…

Probability · Mathematics 2018-08-09 Sergey Foss , Takis Konstantopoulos

Let p(t) be a trigonometric polynomial, non-negative on the unit circle. We say that a measure \sigma belongs to a polynomial Szego class, if the logarithm of its density is summable over the circle with the weight p(t). For the associated…

Classical Analysis and ODEs · Mathematics 2007-05-23 S. Denisov , S. Kupin

We derive the kinematic numerator factors for heavy-mass effective field theory from the field theory limit of the string theory vertex operator kinematic algebra introduced in arXiv:1806.09584. The kinematic numerators are derived as…

High Energy Physics - Theory · Physics 2025-05-21 Chih-Hao Fu , Pierre Vanhove , Yihong Wang

For $t,g>0$, a vertex-weighted graph of total weight $W$ is $(t,g)$-trimmable if it contains a vertex-induced subgraph of total weight at least $(1-1/t)W$ and with no simple path of more than $g$ edges. A family of graphs is trimmable if…

Discrete Mathematics · Computer Science 2008-02-21 Thomas Erlebach , Torben Hagerup , Klaus Jansen , Moritz Minzlaff , Alexander Wolff

In this paper, we study the design and analysis of a class of efficient algorithms for computing the Gromov-Wasserstein (GW) distance tailored to large-scale graph learning tasks. Armed with the Luo-Tseng error bound…

Machine Learning · Computer Science 2022-12-15 Jiajin Li , Jianheng Tang , Lemin Kong , Huikang Liu , Jia Li , Anthony Man-Cho So , Jose Blanchet

A cut of a graph can be represented in many different ways. Here we propose to represent a cut through a ``relation tree'', which is a spanning tree with signed edges. We show that this picture helps to classify the main greedy heuristics…

Quantum Physics · Physics 2023-12-19 Jianan Wang , Chuixiong Wu , Fen Zuo

We compute the asymptotic induced matching number of the $k$-partite $k$-uniform hypergraphs whose edges are the $k$-bit strings of Hamming weight $k/2$, for any large enough even number $k$. Our lower bound relies on the higher-order…

Combinatorics · Mathematics 2019-05-09 Srinivasan Arunachalam , Péter Vrana , Jeroen Zuiddam

Let $X$ be a smooth complex projective variety. Using a construction devised to Gathmann, we present a recursive formula for some of the Gromov-Witten invariants of $X$. We prove that, when $X$ is homogeneous, this formula gives the number…

Algebraic Geometry · Mathematics 2024-08-05 Giosuè Muratore

Let $\fre\subset\bbR$ be a finite union of disjoint closed intervals. We study measures whose essential support is $\fre$ and whose discrete eigenvalues obey a 1/2-power condition. We show that a Szeg\H{o} condition is equivalent to \[…

Spectral Theory · Mathematics 2019-10-29 Jacob S. Christiansen , Barry Simon , Maxim Zinchenko

We use the Bellman function method to give an elementary proof of a sharp weighted estimate for the Haar shifts, which is linear in the $A_2$ norm of the weight and in the complexity of the shift. Together with the representation of a…

Classical Analysis and ODEs · Mathematics 2011-05-12 Sergei Treil

In this paper, we introduce new classes of infinite and combinatorially periodic tensegrities, derived from algebraic multidimensional continued fractions in the sense of F. Klein. We describe the stress coefficients on edges through…

Combinatorics · Mathematics 2024-10-17 Oleg Karpenkov , Fatemeh Mohammadi , Christian Müller , Bernd Schulze

This paper reviews the moment graph technique that allows to translate certain representation theoretic problems into geometric ones. For simplicity we restrict ourselves to the case of semisimple complex Lie algebras. In particular, we…

Representation Theory · Mathematics 2013-10-29 Peter Fiebig

We investigate weighted Lebesgue space estimates for the Bergman projection on a simply connected planar domain via the domain's Riemann map. We extend the bounds which follow from a standard change-of-variable argument in two ways. First,…

Complex Variables · Mathematics 2024-05-31 A. Walton Green , Nathan A. Wagner