Related papers: New recursion formula for the interior polynomial …
In this paper, we introduce polytopes ${\mathcal B}_G$ arising from root systems $B_n$ and finite graphs $G$, and study their combinatorial and algebraic properties. In particular, it is shown that ${\mathcal B}_G$ is reflexive if and only…
The Ehrhart polynomial of an integral convex polytope counts the number of lattice points in dilates of the polytope. In math.CO/0402148, the authors conjectured that for any cyclic polytope with integral parameters, the Ehrhart polynomial…
We study the zero sets of the independence polynomial on recursive sequences of graphs. We prove that for a maximally independent starting graph and a stable and expanding recursion algorithm, the zeros of the independence polynomial are…
The principal observation of the present paper is that an inner isotopy (i.e. a principal isotopy defined by an algebra endomorphism) is a very helpful instrument in constructing and studying interesting classes of nonassociative algebras.…
A method for the analytical evaluation of layer potentials arising in the collocation boundary element method for the Laplace and Helmholtz equation is developed for piecewise flat boundary elements with polynomial shape functions. The…
We introduce a new holographic map for encoding black hole interiors by including both fundamental and effective dynamics. This holographic map is constructed by evolving a state in the effective, semiclassical gravity description of the…
In arXiv:1709.07504 Aguiar and Ardila give a Hopf monoid structure on hypergraphs as well as a general construction of polynomial invariants on Hopf monoids. Using these results, we define in this paper a new polynomial invariant on…
We propose investigating a summation analog of the paradigm for parallel integration. We make some first steps towards an indefinite summation method applicable to summands that rationally depend on the summation index and a P-recursive…
In earlier work in collaboration with Pavel Galashin and Thomas McConville we introduced a version of chip-firing for root systems. Our investigation of root system chip-firing led us to define certain polynomials analogous to Ehrhart…
We generalize regular subdivisions (polyhedral complexes resulting from the projection of the lower faces of a polyhedron) introducing the class of recursively-regular subdivisions. Informally speaking, a recursively-regular subdivision is…
Polytope numbers for a given polytope are an integer sequence defined by the combinatorics of the polytope. Recent work by H. K. Kim and J. Y. Lee has focused on writing polytope number sequences as sums of simplex number sequences. In…
Heckman and Opdam introduced a non-symmetric analogue of Jack polynomials using Cherednik operators. In this paper, we derive a simple recursion formula for these polynomials and formulas relating the symmetric Jack polynomials with the…
For a graph embedded into a surface, we relate many combinatorial parameters of the cycle matroid of the graph and the bond matroid of the dual graph with the topological parameters of the embedding. This will give an expression of the…
We introduce a new combinatorial abstraction for the graphs of polyhedra. The new abstraction is a flexible framework defined by combinatorial properties, with each collection of properties taken providing a variant for studying the…
We present a recursive algorithm for multi-coefficient inversion in nonlinear Helmholtz equations with polynomial-type nonlinearities, utilizing the linearized Dirichlet-to-Neumann map as measurement data. To achieve effective recursive…
Several polytopes arise from finite graphs. For edge and symmetric edge polytopes, in particular, exhaustive computation of the Ehrhart polynomials not merely supports the conjecture of Beck {\it et al.}\ that all roots $\alpha$ of Ehrhart…
We give an effective method to compute the entropy for polynomials orthogonal on a segment of the real axis that uses as input data only the coefficients of the recurrence relation satisfied by these polynomials. This algorithm is based on…
We introduce the notion of non commutative truncated polynomial extension of an algebra A. We study two families of these extensions. For the first one we obtain a complete classification and for the second one, which we call upper…
New approach to systems of polynomial recursions is developed based on the Carleman linearization procedure. The article is divided into two main sections: firstly, we focus on the case of uni-variable depth-one polynomial recurrences.…
The interior polynomial and the exterior polynomial are generalizations of valuations on $(1/\xi,1)$ and $(1,1/\eta)$ of the Tutte polynomial $T_G(x,y)$ of graphs to hypergraphs, respectively. The pair of hypergraphs induced by a connected…