English
Related papers

Related papers: Solution of the Hurwitz problem for Laurent polyno…

200 papers

Studying the existence of rational functions with given branching datum is a classical problem in the field of complex analysis and algebraic geometry. This problem dates back to Hurwitz and remains open to this day. In this paper, we…

Complex Variables · Mathematics 2024-05-30 Zhiqiang Wei , Yingyi Wu , Bin Xu

With each holomorphic map $f: R \rightarrow \mathbb C\mathbb P^1$, where $R$ is a compact Riemann surface, one can associate a combinatorial datum consisting of the genus $g$ of $R$, the degree $n$ of $f$, the number $q$ of branching points…

Geometric Topology · Mathematics 2025-05-08 Fedor Pakovich

Let $\Lambda$ be a collection of partitions of a positive integer $d$ of the form $$(a_1,\cdots, a_p),\,(b_1,\cdots, b_q),\,(m_1+1,1,\cdots,1),\cdots, (m_l+1,1,\cdots,1),$$ where $(m_1,\cdots, m_l)$ is a partition of $p+q-2>0$. We prove…

Geometric Topology · Mathematics 2020-05-15 Jijian Song , Bin Xu

We investigate the Hurwitz existence problem from a computational viewpoint. Leveraging the symmetric-group algorithm by Zheng and building upon implementations originally developed by Baroni, we achieve a complete and non-redundant…

Group Theory · Mathematics 2025-12-10 Yiru Wang , Bingqian Li , Yi Zhou , Zhiqiang Wei , Yu Ye , Yiqian Shi , Bin Xu

A generalization of Hurwitz stable polynomials to real rational functions is considered. We establishe an analogue of the Hurwitz stability criterion for rational functions and introduce a new type of determinants that can be treated as a…

Classical Analysis and ODEs · Mathematics 2025-07-01 Yury S. Barkovsky , Mikhail Tyaglov

In this note we provide a new partial solution to the Hurwitz existence problem for surface branched covers. Namely, we consider candidate branch data with base surface the sphere and one partition of the degree having length two, and we…

Geometric Topology · Mathematics 2024-05-20 Filippo Baroni , Carlo Petronio

To a branched cover f between orientable surfaces one can associate a certain branch datum D(f), that encodes the combinatorics of the cover. This D(f) satisfies a compatibility condition called the Riemann-Hurwitz relation. The old but…

Geometric Topology · Mathematics 2021-06-30 Carlo Petronio , Filippo Sarti

This manuscript studies a special case of the Hurwitz enumeration problem: for branched covers from genus g compact Riemann surface to the Riemann sphere, with three branch points, and require the branching data at one of the branch points…

Combinatorics · Mathematics 2026-05-26 Yi Song

Let $f\in \mathbb{Q}(x)$ be a non-constant rational function. We consider "Waring's Problem for $f(x)$," i.e., whether every element of $\bbq$ can be written as a bounded sum of elements of $\{f(a)\mid a\in \mathbb{Q}\}$. For rational…

Number Theory · Mathematics 2018-01-23 Bo-Hae Im , Michael Larsen

We establish a structure theorem for rational maps $f:\overline{\mathbb{C}}\to\overline{\mathbb{C}}$: the pullback metric $f^{*}{\rm d}s_{0}^{2}$ of the standard metric ${\rm d}s_{0}^{2}$ admits a canonical decomposition into finitely many…

Differential Geometry · Mathematics 2026-05-19 Zhiqiang Wei

Questions concerning small fractional parts of polynomials and pseudo-polynomials have a long history in analytic number theory. In this paper, we improve on earlier work by Madritsch and Tichy. In particular, let $f=P+\phi$ where $P$ is a…

Number Theory · Mathematics 2021-10-11 Paolo Minelli

We discuss integrable aspects of the logarithmic contribution of the partition function of cosmological critical topologically massive gravity. On one hand, written in terms of Bell polynomials which describe the statistics of set…

High Energy Physics - Theory · Physics 2022-04-20 Yannick Mvondo-She

We show that the partition function of the logarithmic sector of critical topologically massive gravity which represents a series expansion of composition of functions, can be expressed as a sum over rooted trees. Our work brings a…

High Energy Physics - Theory · Physics 2024-03-29 Yannick Mvondo-She

In this note, we polynomially reduce an instance of the partition problem to a dynamic lot sizing problem, and show that solving the latter problem solves the former problem. By solving the dynamic program formulation of the dynamic lot…

Computational Complexity · Computer Science 2025-12-24 Chee-Khian Sim

Given a set of integers W, the Partition problem determines whether W can be divided into two disjoint subsets with equal sums. We model the Partition problem as a system of polynomial equations, and then investigate the complexity of a…

Algebraic Geometry · Mathematics 2014-11-12 Susan Margulies , Shmuel Onn , Dmitrii Pasechnik

The work considers a system of fractional order partial differential equations. The existence and uniqueness theorems for the classical solution of initial-boundary value problems are proved in two cases: 1) the right-hand side of the…

Analysis of PDEs · Mathematics 2024-03-28 Ravshan Ashurov , Oqila Muhiddinova

In the 1920's, Ritt studied the operation of functional composition g o h(x) = g(h(x)) on complex rational functions. In the case of polynomials, he described all the ways in which a polynomial can have multiple `prime factorizations' with…

Number Theory · Mathematics 2007-10-11 Michael E. Zieve

In this paper we proved a theorems of existence and uniqueness of solutions of differential equation of second order with fractional derivative in the Kipriyanov sense in lower terms. As a domain of definition of the functions we consider…

Functional Analysis · Mathematics 2017-11-17 M. V. Kukushkin

In this paper, we investigate decompositions of the partition function $p(n)$ from the additive theory of partitions considering the famous M\"{o}bius function $\mu(n)$ from multiplicative number theory. Some combinatorial interpretations…

Combinatorics · Mathematics 2023-10-23 Mircea Merca , Maxie D. Schmidt

The number partition problem is a well-known problem, which is one of 21 Karp's NP-complete problems \cite{karp}. The partition function is a boolean function that is equivalent to the number partition problem with number range restricted.…

Computational Complexity · Computer Science 2022-12-25 Chuyu Xiong
‹ Prev 1 2 3 10 Next ›