相关论文: Combinatorial problems in finite geometry and lacu…
This paper is about the combinatorics of finite point configurations in the tropical projective space or, dually, of arrangements of finitely many tropical hyperplanes. Moreover, arrangements of finitely many tropical halfspaces can be…
Many combinatorial problems can be formulated as a polynomial optimization problem that can be solved by state-of-the-art methods in real algebraic geometry. In this paper we explain many important methods from real algebraic geometry, we…
We prove that the existence of finite combinatorial objects such as affine planes, mutually orthogonal Latin squares, and resolvable balanced incomplete block designs can be reformulated as the existence of certain algorithmic reductions…
This is a survey on algorithmic questions about combinatorial and geometric properties of convex polytopes. We give a list of 35 problems; for each the current state of knowledege on its theoretical complexity status is reported. The…
Arithmetic combinatorics is often concerned with the problem of bounding the behaviour of arbitrary finite sets in a group or ring with respect to arithmetic operations such as addition or multiplication. Similarly, combinatorial geometry…
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…
This work is a study of polynomial compositions having a fixed number of terms. We outline a recursive method to describe these characterizations, give some particular results and discuss the general case. In the final sections, some…
We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
We introduce the convex combinatorial optimization problem, a far reaching generalization of the standard linear combinatorial optimization problem. We show that it is strongly polynomial time solvable over any edge-guaranteed family, and…
We study the combinatorics of hyperplane arrangements over arbitrary fields. Specifically, we determine in which situation an arrangement and its reduction modulo a prime number have isomorphic lattices via the use of minimal strong…
This chapter introduces and elaborates on the fruitful interplay of coding theory and algebraic combinatorics, with most of the focus on the interaction of codes with combinatorial designs, finite geometries, simple groups, sphere packings,…
We give an overview of recent progress around a problem introduced by Elekes and R\'onyai. The prototype problem is to show that a polynomial $f\in \mathbb{R}[x,y]$ has a large image on a Cartesian product $A\times B\subset \mathbb{R}^2$,…
A combinatorial theory for type $R_I$ orthogonal polynomials is given. The ingredients include weighted generalized Motzkin paths, moments, continued fractions, determinants, and histories. Several explicit examples in the Askey scheme are…
This note contains a solution to the following problem: reconstruct the definition field and the equation of a projective cubic surface, using only combinatorial information about the set of its rational points. This information is encoded…
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…
We study combinatorial problems related to the singularities and boundary components of toroidal compactifications of orthogonal modular varieties. In particular, those associated with the moduli of algebraic deformation generalised Kummer…
We initiate the combinatorial study of factorization systems on finite lattices, paying special attention to the role that reflective and coreflective factorization systems play in partitioning the poset of factorization systems on a fixed…
The paper is devoted to some extremal problems, related to convex polygons in the Euclidean plane and their perimeters. We present a number of results that have simple formulations, but rather intricate proofs. Related and still unsolved…
Combinatorial $t$-designs have nice applications in coding theory, finite geometries and several engineering areas. There are two major methods of constructing $t$-designs. One of them is via group actions of certain permutation groups…