Related papers: The perimeter generating function for nondirected …
We present a simple formula for the generating function for the polynomials in the $d$--dimensional semiclassical wave packets. We then use this formula to prove the associated Rodrigues formula.
In this paper we study the structure of cellular pseudomanifolds (aka abstract polytopes). These are natural combinatorial generalisations of polytopal spheres (i.e., boundary complexes of convex polytopes). This class is closed under…
In this paper we introduce 1-$D$ and 2-$D$ discrete models for the dynamic granular matter formation process in the form of a system of difference equations. This approach allows us to differentiate between the influx of the rolling layer…
Two models of random cones in high dimensions are considered, together with their duals. The Donoho-Tanner random cone $D_{n,d}$ can be defined as the positive hull of $n$ independent $d$-dimensional Gaussian random vectors. The Cover-Efron…
Generalizing both mixed-integer linear optimization and convex optimization, mixed-integer convex optimization possesses broad modeling power but has seen relatively few advances in general-purpose solvers in recent years. In this paper, we…
This paper introduces novel relaxation hierarchies for concavo-convex programs (CXP), a class of problems that includes disjoint bilinear programming (DBP) and concave minimization (CM) as special cases. At the core of these hierarchies is…
Simple rectilinear polygons (i.e. rectilinear polygons without holes or cutpoints) can be regarded as finite rectangular cell complexes coordinatized by two finite dendrons. The intrinsic $l_1$-metric is thus inherited from the product of…
We define the excess degree $\xi(P)$ of a $d$-polytope $P$ as $2f_1-df_0$, where $f_0$ and $f_1$ denote the number of vertices and edges, respectively. This parameter measures how much $P$ deviates from being simple. It turns out that the…
A digraph $D=(V,A)$ of order $n\geq 3$ is pancyclic, whenever $D$ contains a directed cycle of length $k$ for each $k\in\{3,...,n\}$; and D is vertex-pancyclic iff, for each vertex $v\in V$ and each $k\in \{3,...,n\}$, $D$ contains a…
We consider the problem of decomposing a multivariate polynomial as the difference of two convex polynomials. We introduce algebraic techniques which reduce this task to linear, second order cone, and semidefinite programming. This allows…
For the Kautz digraph $K(d,D)$, let $\rho_k(d,D)$ be the number of oriented edges whose shortest directed cycle has length $k+1$, and define $\Delta_k(d,D) = \rho_k(d,D) - \rho_k(d,D-1)$. We give an exact, finite-dimensional matrix product…
We analyse the complexity of computing class polynomials, that are an important ingredient for CM constructions of elliptic curves, via complex floating point approximations of their roots. The heart of the algorithm is the evaluation of…
Oriented matroids (often called order types) are combinatorial structures that generalize point configurations, vector configurations, hyperplane arrangements, polyhedra, linear programs, and directed graphs. Oriented matroids have played a…
In this paper we derive aggregate separation bounds, named after Davenport-Mahler-Mignotte (\dmm), on the isolated roots of polynomial systems, specifically on the minimum distance between any two such roots. The bounds exploit the…
We study the existence and construction of circulant matrices $C$ of order $n\geq2$ with diagonal entries $d\geq0$, off-diagonal entries $\pm1$ and mutually orthogonal rows. These matrices generalize circulant conference ($d=0$) and…
A convex polytope $P$ in the real projective space with reflections in the facets of $P$ is a Coxeter polytope if the reflections generate a subgroup $\Gamma$ of the group of projective transformations so that the $\Gamma$-translates of the…
Motivated by the $(q,\gamma)$-cumulants, introduced by Xu [arXiv:2303.13812] to study $\beta$-deformed singular values of random matrices, we define the $(n,d)$-rectangular cumulants for polynomials of degree $d$ and prove several…
It is well-known and easy to show that even the following version of the directed travelling salesman problem is NP-complete: Given a strongly connected complete digraph $D=(V,A)$, a cost function $w: A\rightarrow \{0,1\}$ and a natural…
We prove that for any fixed d the generating function of the projection of the set of integer points in a rational d-dimensional polytope can be computed in polynomial time. As a corollary, we deduce that various interesting sets of lattice…
The simplest rigourous, non-circular proof that d(cos x) = -sen x. Some details omitted if the gap is intuitive, nevertheles, each gap is easily filled, rigourously. As Ehrenpreis and others have pointed out, the usual text book `proof' is…