English
Related papers

Related papers: Counting Planar Eulerian Orientations

200 papers

This paper presents "oriented pivoting systems" as an abstract framework for complementary pivoting. It gives a unified simple proof that the endpoints of complementary pivoting paths have opposite sign. A special case are the Nash…

Discrete Mathematics · Computer Science 2015-07-28 László A. Végh , Bernhard von Stengel

Lame equation arises from deriving Laplace equation in ellipsoidal coordinates; in other words, it's called ellipsoidal harmonic equation. Lame function is applicable to diverse areas such as boundary value problems in ellipsoidal geometry,…

Mathematical Physics · Physics 2014-11-10 Yoon Seok Choun

We introduce a matrix model describing the fully-packed O(n) model on random Eulerian triangulations (i.e. triangulations with all vertices of even valency). For n=1 the model is mapped onto a particular gravitational 6-vertex model with…

Statistical Mechanics · Physics 2007-05-23 P. Di Francesco , E. Guitter , C. Kristjansen

We study Hilbert schemes of points on a smooth projective Calabi-Yau 4-fold $X$. We define $\mathrm{DT}_4$ invariants by integrating the Euler class of a tautological vector bundle $L^{[n]}$ against the virtual class. We conjecture a…

Algebraic Geometry · Mathematics 2018-12-05 Yalong Cao , Martijn Kool

Given two linearly independent matrices in $so(3)$, $Z_1$ and $Z_2$, every rotation matrix $X_f \in SO(3)$ can be written as the product of alternate elements from the one dimensional subgroups corresponding to $Z_1$ and $Z_2$, namely…

Quantum Physics · Physics 2007-05-23 Domenico D'Alessandro

This article is concerned with an example of complex planar geometry arising from flat origami challenges. The complexity of solution algorithms is illustrated, depending on the depth of the initial analysis of the problem, starting from…

Computational Geometry · Computer Science 2017-05-30 David Dureisseix

In [Grenier-Nguyen], we introduced so called {\em generators} functions to precisely follow the regularity of analytic solutions of Navier Stokes equations. In this short note, we give a presentation of these generator functions and use…

Analysis of PDEs · Mathematics 2019-12-03 Emmanuel Grenier , Toan T. Nguyen

Explicit expressions are considered for the generating functions concerning the number of planar diagrams with given numbers of 3- and 4-point vertices. It is observed that planar renormalization theory requires diagrams with restrictions,…

High Energy Physics - Theory · Physics 2009-10-31 Gerard 't Hooft

At a crossroads of calculus and combinatorics, the generating function of secant and tangent numbers (Euler numbers) provides enumeration of alternating permutations. In this article, we present a new refinement of Euler numbers to answer…

Combinatorics · Mathematics 2020-11-17 Masato Kobayashi

We present a new tool to compute the number $\phi_\A (\b)$ of integer solutions to the linear system $$ \x \geq 0 \qquad \A \x = \b $$ where the coefficients of $\A$ and $\b$ are integral. $\phi_\A (\b)$ is often described as a \emph{vector…

Combinatorics · Mathematics 2007-05-23 Matthias Beck

This paper deals with efficient numerical methods for computing the action of the generating function of Bernoulli polynomials, say $q(\tau,w)$, on a typically large sparse matrix. This problem occurs when solving some non-local boundary…

Numerical Analysis · Mathematics 2025-09-03 Lidia Aceto , Luca Gemignani

We view the determinant and permanent as functions on directed weighted graphs and introduce their analogues for the undirected graphs. We prove that the task of computing the undirected determinants as well as permanents for planar graphs,…

Combinatorics · Mathematics 2021-08-31 Diana Dziewa-Dawidczyk , Adam J. Przeździecki

We consider various classes of Motzkin trees as well as lambda-terms for which we derive asymptotic enumeration results. These classes are defined through various restrictions concerning the unary nodes or abstractions, respectively: We…

Combinatorics · Mathematics 2015-10-06 Olivier Bodini , Danièle Gardy , Bernhard Gittenberger , Zbigniew Gołębiewski

The u-plane integral is the contribution of the Coulomb branch to correlation functions of N=2 gauge theory on a compact four-manifold. We consider the u-plane integral for correlators of point and surface observables of topologically…

High Energy Physics - Theory · Physics 2019-10-30 Georgios Korpas , Jan Manschot , Gregory W. Moore , Iurii Nidaiev

We investigate the complexity of counting Eulerian tours ({\sc #ET}) and its variations from two perspectives---the complexity of exact counting and the complexity w.r.t. approximation-preserving reductions (AP-reductions \cite{MR2044886}).…

Computational Complexity · Computer Science 2010-09-28 Qi Ge , Daniel Stefankovic

It is shown that a SU(1,1) algebra may be used to provide a unified description of the simple hamonic oscillator and the angular momentum algebras and a class of other semi-infinite algebras. A normal ordered representation of a Unitary…

Mathematical Physics · Physics 2018-09-14 C. V. Sukumar

We give an algorithm to compute weighted Ehrhart functions of lattice polytopes for polynomial weights using Lagrange interpolation. We show how to compute generating functions of polynomials using those of unit cubes and Eulerian numbers,…

Combinatorics · Mathematics 2026-01-06 Enrique Reyes , Carlos E. Valencia , Rafael H. Villarreal

We construct two families of orthogonal polynomials associated with the universal central extensions of the superelliptic Lie algebras. These polynomials satisfy certain fourth order linear differential equations, and one of the families is…

Representation Theory · Mathematics 2025-07-23 Felipe Albino dos Santos , Mikhail Neklyudov , Vyacheslav Futorny

Recently there has been a renewed interest in asymptotic Euler-MacLaurin formulas, partly due to applications to spectral theory of differential operators. Using elementary means, we recover such formulas for compactly supported smooth…

Classical Analysis and ODEs · Mathematics 2014-12-01 Yohann Le Floch , Álvaro Pelayo

We compute the nonlinearity of Boolean functions with Groebner basis techniques, providing two algorithms: one over the binary field and the other over the rationals. We also estimate their complexity. Then we show how to improve our…

Information Theory · Computer Science 2014-04-11 E. Bellini , I. Simonetti , M. Sala