相关论文: Combinatorial problems in finite geometry and lacu…

We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…

In this paper, we compute the number of self-intersections of a plane projection of a generic complete intersection curve defined by polynomials with the given support. Moreover, we discuss the tropical counterpart of this problem.

We examine a number of results of infinite combinatorics using the techniques of reverse mathematics. Our results are inspired by similar results in recursive combinatorics. Theorems included concern colorings of graphs and bounded graphs,…

Combinatorial $t$-designs have been an interesting topic in combinatorics for decades. It was recently reported that the image sets of a fixed size of certain special polynomials may constitute a $t$-design. Till now only a small amount of…

In recent years, many useful applications of the polynomial method have emerged in finite geometry. Indeed, algebraic curves, especially those defined by R\'edei-type polynomials, are powerful in studying blocking sets. In this paper, we…

We discuss methods to construct a polynomial parametrization of some interesting knotted surfaces (knotted spheres, knotted tori and knotted planes) and provide examples.

A survey of problems, conjectures, and theorems about quasi-isometric classification and rigidity for finitely generated solvable groups.

We study the projections in vector spaces over finite fields. We prove finite fields analogues of the bounds on the dimensions of the exceptional sets for Euclidean projection mapping. We provide examples which do not have exceptional…

This paper presents a combinatorial analog of topological complexity for finite spaces. We demonstrate that this coincides with the genuine topological complexity of the original finite space, and constitutes an upper bound for the…

Radical binomial ideals associated with finite lattices are studied. Gr\"obner basis theory turns out to be an efficient tool in this investigation.

We give a broad survey of recent results in Enumerative Combinatorics and their complexity aspects.

In this paper, we consider a problem of Lang about finiteness of torsion points on plane rational curves over $\mathbb C$, and prove some results towards a matrix analogue of this problem.

Several tools have been developed to enhance automation of theorem proving in the 2D plane. However, in 3D, only a few approaches have been studied, and to our knowledge, nothing has been done in higher dimensions. In this paper, we present…

We review the relationship between discrete groups of symmetries of Euclidean three-space, constructions in algebraic geometry around Kleinian singularities including versions of Hilbert and Quot schemes, and their relationship to…

We present a detailed study of the combinatorial interpretation of matrix integrals, including the examples of tessellations of arbitrary genera, and loop models on random surfaces. After reviewing their methods of solution, we apply these…

We formulate a number of new results in Algebraic Geometry and outline their derivation from Theorem 2.12 which belongs to Algebraic Combinatorics.

We give a review of modern approaches to constructing formal solutions to integrable hierarchies of mathematical physics, whose coefficients are answers to various enumerative problems. The relationship between these approaches and…

We begin the study of the consequences of the existence of certain infinite matrices. Our present application is to compactness of products of topological spaces.

The aim of this paper is to study finite orthogonal polynomials on a cone of revolution and its surface. We define two classes of finite orthogonal polynomials on the solid cone and derive their corresponding differential equations and…

We develop an algorithmic theory of convex optimization over discrete sets. Using a combination of algebraic and geometric tools we are able to provide polynomial time algorithms for solving broad classes of convex combinatorial…