相关论文: Newton polyhedra of discriminants of projections
Moore's Conjecture is shown to hold for generalized moment-angle complexes and a criterion is proved that determines when a polyhedral product is elliptic or hyperbolic.
In this paper, we will show that strong approximation with Brauer-Manin obstruction holds for certain quadratic fibration such that none of fibers satisfies strong approximation with Brauer-Manin obstruction. Moreover, we develop the…
The concept of representing a polytope that is associated with some combinatorial optimization problem as a linear projection of a higher-dimensional polyhedron has recently received increasing attention. In this paper (written for the…
We consider the problem of complex root classification, i.e., finding the conditions on the coefficients of a univariate polynomial for all possible multiplicity structures on its complex roots. It is well known that such conditions can be…
For a cycle of codimension 1 in a toric variety, its degree with respect to a nef toric divisor can be understood in terms of the mixed volume of the polytopes associated to the divisor and to the cycle. We prove here that an analogous…
A product of cochains in a polyhedral complex is constructed. The multiplication algorithm depends on the choice of a parameter. The parameter is a linear functional on the ambient space. Cocycles form a subring of the ring of cochains,…
The motivation of this work stems from the numerical approximation of bounded functions by polynomials satisfying the same bounds. The present contribution makes use of the recent algebraic characterization found in [B. Despr\'es, Numer.…
The K-partitioning problem consists of partitioning the vertices of a graph in K sets so as to minimize a function of the edge weights. We introduce a linear mixed integer formulation with edge variables and representative variables. We…
The Stoker problem, first formulated in 1968, consists in understanding to what extent a convex polyhedron is determined by its dihedral angles. By means of the double construction, this problem is intimately related to rigidity issues for…
This paper is an introduction to Coxeter polyhedra in spherical, Euclidean, and hyperbolic geometries. It consists of essentially two parts that could be read independently. In the first we introduce non-obtuse polyhedra in the spherical,…
We bound the complexity of the fibers of the generic linear projection of a smooth variety in terms of a new family of invariants. These invariants are closely related to ideas of John Mather, and we give a simple proof of his bound on the…
We study the $p$-adic absolute value of the roots of the $L$-functions associated to certain twisted character sums, and additive character sums associated to polynomials $P(x^d)$, when $P$ varies among the space of polynomial of fixed…
For prime $p\equiv-1\bmod d$ and $q$ a power of $p$, we obtain the slopes of the $q$-adic Newton polygons of $L$-functions of $x^d+ax^{d-1}\in \mathbb{F}_q[x]$ with respect to finite characters $\chi$ when $p$ is larger than an explicit…
A weight-dependent generalization of the binomial theorem for noncommuting variables is presented. This result extends the well-known binomial theorem for q-commuting variables by a generic weight function depending on two integers. For a…
In 2022, Brugall{\'e} and Jaramillo-Puentes showed that the coefficients of small codegree of the tropical refined invariant are polynomial in the Newton polygon. This raised the question of the existence of universal polynomials giving…
We are concerned with the monic orthogonal polynomials with respect to a singularly perturbed Laguerre-type weight. By using the ladder operator approach, we derive a complicated system of nonlinear second-order difference equations…
We prove a generalization of classical Montel's theorem for the mixed differences case, for polynomials and exponential polynomial functions, in commutative setting.
We use tropical geometry to compute the multidegree and Newton polytope of the hypersurface of a statistical model with two hidden and four observed binary random variables, solving an open question stated by Drton, Sturmfels and Sullivant…
We use the differential algebra of polytopes to explain the known remarkable relation of the combinatorics of the associahedra and permutohedra with the universal compositional and multiplicative inversion formulas for the formal power…
Finding roots of equations is at the heart of most computational science. A well-known and widely used iterative algorithm is the Newton's method. However, its convergence depends heavily on the initial guess, with poor choices often…