相关论文: Classification of quad-equations on a cuboctahedro…

Quadratic Poisson brackets on a vector space equipped with a bilinear multiplication are studied. A notion of a bracket compatible with the multiplication is introduced and an effective criterion of such compatibility is given. Among…

In this work we study the polytope associated with a 0/1 integer programming formulation for the Equitable Coloring Problem. We find several families of valid inequalities and derive sufficient conditions in order to be facet-defining…

In this note we introduce the problem of illumination of convex bodies in spherical spaces and solve it for a large subfamily of convex bodies. We derive from it a combinatorial version of the classical illumination problem for convex…

We present a number of complexity results concerning the problem of counting vertices of an integral polytope defined by a system of linear inequalities. The focus is on polytopes with small integer vertices, particularly 0/1 polytopes and…

In this work we study the polytope associated with a 0,1-integer programming formulation for the Equitable Coloring Problem. We find several families of valid inequalities and derive sufficient conditions in order to be facet-defining…

We define a combinatorial object that can be associated with any conic-line arrangement with ordinary singularities, which we call the combinatorial Poincar\'e polynomial. We prove a Terao-type factorization statement on the splitting of…

In this paper, we prove several Poincar\'e inequalities of fractional type on conformally flat manifolds with finite total Q-curvature. This shows a new aspect of the $Q$-curvature on noncompact complete manifolds.

Several cubature formulas on the cubic domains are derived using the discrete Fourier analysis associated with lattice tiling, as developed in \cite{LSX}. The main results consist of a new derivation of the Gaussian type cubature for the…

We consider the bipartite boolean quadric polytope (BQP) with multiple-choice constraints and analyse its combinatorial properties. The well-studied BQP is defined as the convex hull of all quadric incidence vectors over a bipartite graph.…

A Newton-Okounkov polytope of a complete flag variety can be turned into a convex geometric model for Schubert calculus. Namely, we can represent Schubert cycles by linear combinations of faces of the polytope so that the intersection…

For a binary quadratic form $Q$, we consider the action of $\mathrm{SO}_Q$ on a two-dimensional vector space. This representation yields perhaps the simplest nontrivial example of a prehomogeneous vector space that is not irreducible, and…

We prove quasi-monotonicity formulae for classical obstacle-type problems with quadratic energies with coefficients in fractional Sobolev spaces, and a linear term with a Dini-type continuity property. These formulae are used to obtain the…

We express discrete Painlev\'e equations as discrete Hamiltonian systems. The discrete Hamiltonian systems here mean the canonical transformations defined by generating functions. Our construction relies on the classification of the…

We study geometric consistency relations between angles of 3-dimensional (3D) circular quadrilateral lattices -- lattices whose faces are planar quadrilaterals inscribable into a circle. We show that these relations generate canonical…

The hamiltonian circuit polytope is the convex hull of feasible solutions for the circuit constraint, which provides a succinct formulation of the traveling salesman and other sequencing problems. We study the polytope by establishing its…

This paper introduces a notion of 2-orthogonality for a sequence of polynomials to give extended versions of the Meixner and Feinsilver characterization results based on orthogonal polynomials. These new versions subsume the Letac-Mora…

In this paper we consider the classification of dispersive linearizable partial difference equations defined on a quad-graph by the multiple scale reduction around their harmonic solution. We show that the A_1, A_2 and A_3 linearizability…

Lorentzian polynomials are a fascinating class of real polynomials with many applications. Their definition is specific to the nonnegative orthant. Following recent work, we examine Lorentzian polynomials on proper convex cones. For a…

We discuss notions of Gauss curvature and mean curvature for polyhedral surfaces. The discretizations are guided by the principle of preserving integral relations for curvatures, like the Gauss/Bonnet theorem and the mean-curvature force…

The affinely regular polygons in certain planar sets are characterized. It is also shown that the obtained results apply to cyclotomic model sets and, additionally, have consequences in the discrete tomography of these sets.