Related papers: The area generating function for simple-2-column p…
The multiplicative structure of the trivial symplectic groupoid over $\mathbb R^d$ associated to the zero Poisson structure can be expressed in terms of a generating function. We address the problem of deforming such a generating function…
We construct a symmetric monoidal closed category of polynomial endofunctors (as objects) and simulation cells (as morphisms). This structure is defined using universal properties without reference to representing polynomial diagrams and is…
We study generating functions in the context of Rota-Baxter algebras. We show that exponential generating functions can be naturally viewed in a very special case of complete free commutative Rota-Baxter algebras. This allows us to use free…
In this paper, we study pattern matching in the set F_{n,k} of fillings of the k x n rectangle with the integers 1,...,kn such that the elements in any column increase from bottom to top. Let P be a column strict tableau of shape 2^k. We…
We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact formula and an asymptotic approximation. We also consider the…
We introduce an expressive subclass of non-negative almost submodular set functions, called strongly 2-coverage functions which include coverage and (sums of) matroid rank functions, and prove that the homogenization of the generating…
In this article, we study the normal generation of the mapping class group. We first show that a mapping class is a normal generator if its restriction on the invariant subsurface normally generates the (pure) mapping class group of the…
In this short note we prove a sector counting lemma for a class of Fermi surface on the plane which are $C^2$-differentiable and strictly convex. This result generalizes the one proved in \cite{FKT} for the class of…
For L-convex polyominoes we give the asymptotics of the generating function coefficients, obtained by analysis of the coefficients derived from the functional equation given by Castiglione et al. \cite{CFMRR7}. For 201-avoiding ascent…
The primal-dual column generation method (PDCGM) is a general-purpose column generation technique that relies on the primal-dual interior point method to solve the restricted master problems. The use of this interior point method variant…
The main object of this paper is to construct a new generating function of the (q-) Bernstein type polynomials. We establish elementary properties of this function. By using this generating function, we derive recurrence relation and…
In this paper two important classes of orthogonal polynomials in higher dimensions using the framework of Clifford analysis are considered, namely the Clifford-Hermite and the Clifford-Gegenbauer polynomials. For both classes an explicit…
This paper presents a new column-and-constraint generation method for two-stage robust mixed-integer programs with finite uncertainty sets. Our method combines and extends speed-up techniques used in previous column-and-constraint…
In this paper we give the projective generation of congruences of order 1 of r-dimensional projective spaces in P^N from their focal loci. In a natural way, this construction shows that the corresponding surfaces in the grassmannian are the…
The Minkowski problem for a class of unbounded closed convex sets is considered. This is equivalent to a Monge-Amp\`ere equation on a bounded convex open domain with possibly non-integrable given data. A complete solution (necessary and…
The present paper provides a generalization of the previous authors' work on Bellman functions for integral functionals on $\mathrm{BMO}$. Those Bellman functions are the minimal locally concave functions on parabolic strips in the plane.…
A Catalan word is a sequence $w_1w_2\cdots w_n$ of nonnegative integers such that $w_1=0$ and $w_{i}\leq w_{i-1}+1$ for $2\leq i\leq n$. Given a Catalan word, we construct a column-convex polyomino (or \emph{bargraph}) by placing, at…
The generating function of the cumulants in random matrix models, as well as the cumulants themselves, can be expanded as asymptotic (divergent) series indexed by maps. While at fixed genus the sums over maps converge, the sums over genera…
We investigate how to make the surface of a convex polyhedron (a polytope) by folding up a polygon and gluing its perimeter shut, and the reverse process of cutting open a polytope and unfolding it to a polygon. We explore basic enumeration…
It is well-known that the convex and concave envelope of a multilinear polynomial over a box are polyhedral functions. Exponential-sized extended and projected formulations for these envelopes are also known. We consider the convexification…