相关论文: Cut-and-join equation for monotone Hurwitz numbers…

We propose a novel algorithm for calculating multi-baryon correlation functions on the lattice. By considering the permutation of quarks (Wick contractions) and color/spinor contractions simultaneously, we construct a unified index list for…

The existence and stability of collisional kinetic equation, especially non-cutoff Boltzmann equation, in bounded domain with physical boundary condition is longstanding open problem. This work proves the global stability of the Landau…

We consider multi-matrix models that are generating functions for the numbers of branched covers of the complex projective line ramified over $n$ fixed points $z_i$, $i=1,\dots,n$, (generalized Grotendieck's dessins d'enfants) of fixed…

Polynomial-in-time algorithms for computing classical Hurwitz numbers were given in [4] based on the Pandharipande equation. The paritition function of double Hurwitz numbers was proved [21] to satisfy the 2-Toda hierarchy. In this paper,…

In this paper, we construct the cut-and-join operator description for the generating functions of all intersection numbers of $\psi$, $\kappa$, and $\Theta$ classes on the moduli spaces $\overline{\mathcal M}_{g,n}$. The cut-and-join…

We derive a simple criterion that ensures uniqueness, Lipschitz stability and global convergence of Newton's method for the finite dimensional zero-finding problem of a continuously differentiable, pointwise convex and monotonic function.…

We prove existence of infinitely many classical periodic solutions with periodic boundary conditions for a class of monotone semilinear wave equations. Our argument relies on some new estimates for the linear problem with periodic boundary…

Kuhn-Tucker points play a fundamental role in the analysis and the numerical solution of monotone inclusion problems, providing in particular both primal and dual solutions. We propose a class of strongly convergent algorithms for…

In sequent calculi, cut elimination is a property that guarantees that any provable formula can be proven analytically. For example, Gentzen's classical and intuitionistic calculi LK and LJ enjoy cut elimination. The property is less…

A factorisation problem in the symmetric group is central if conjugate permutations always have the same number of factorisations. We give the first fully combinatorial proof of the centrality of transitive star factorisations that is valid…

In this ``experimental'' research, we use known topological recursion relations in genera-zero, -one, and -two to compute the n-point descendant Gromov-Witten invariants of P^1 for arbitrary degrees and low values of n. The results are…

We establish a reversal of Lyapunov's inequality for monotone log-concave sequences, settling a conjecture of Havrilla-Tkocz and Melbourne-Tkocz. A strengthened version of the same conjecture is disproved through counter example. We also…

We consider the problem of numerically computing a critical point of a functional $J\colon M\rightarrow R$ where $M$ is a Riemannian manifold. Due to local quadratic convergence a popular choice to solve this problem is the geometric Newton…

Using calculus we show how to prove some combinatorial inequalities of the type log-concavity or log-convexity. It is shown by this method that binomial coefficients and Stirling numbers of the first and second kinds are log-concave, and…

We study the structure of the Goulden-Jackson-Vakil formula that relates Hurwitz numbers to some conjectural "intersection numbers" on a conjectural family of varieties $X_{g,n}$ of dimension $4g-3+n$. We give explicit formulas for the…

This article investigates when homotopies can be converted to monotone homotopies without increasing the lengths of curves. A monotone homotopy is one which consists of curves which are simple or constant, and in which curves are pairwise…

Parametric families in the centre ${\bf Z}({\bf C}[S_n])$ of the group algebra of the symmetric group are obtained by identifying the indeterminates in the generating function for Macdonald polynomials as commuting Jucys-Murphy elements.…

We develop a new method to compute the homology groups of finite topological spaces (or equivalently of finite partially ordered sets) by means of spectral sequences giving a complete and simple description of the corresponding…

We give an elementary proof of a monotone selection principle which allows to pass from increasing nets to increasing sequences in the Hermitian part of a $\sigma$-finite von Neumann algebra. This is to be seen as a ``monotone version'' of…

We study composite optimization problems in which the smooth part of the objective function is \( p \)-times continuously differentiable, where \( p \geq 1 \) is an integer. Higher-order methods are known to be effective for solving such…