Related papers: Borsuk and V\'azsonyi problems through Reuleaux po…
Musta\c{t}\u{a} has given a conjecture for the graded Betti numbers in the minimal free resolution of the ideal of a general set of points on an irreducible projective algebraic variety. For surfaces in $\mathbb P^3$ this conjecture has…
The existence of a polynomial kernel for Odd Cycle Transversal was a notorious open problem in parameterized complexity. Recently, this was settled by the present authors (Kratsch and Wahlstr\"om, SODA 2012), with a randomized polynomial…
The Meridional Rank Conjecture asks whether the bridge number of a knot in $S^3$ is equal to the minimal number of meridians needed to generate the fundamental group of its complement. In this paper we investigate the analogous conjecture…
We show that a nontrivial graph isomorphism problem of two undirected graphs, and more generally, the permutation similarity of two given $n\times n$ matrices, is equivalent to equalities of volumes of the induced three convex bounded…
A famous conjecture of Ryser states that every $r$-partite hypergraph has vertex cover number at most $r - 1$ times the matching number. In recent years, hypergraphs meeting this conjectured bound, known as $r$-Ryser hypergraphs, have been…
The classical Busemann-Petty problem (1956) asks, whether origin-symmetric convex bodies in $\mathbb {R}^n$ with smaller hyperplane central sections necessarily have smaller volumes. It is known, that the answer is affirmative if $n\le 4$…
This article surveys our ongoing project about the relationship between invariants extending the classical Rohlin invariant of homology spheres and those coming from 4-dimensional (Yang-Mills) gauge theory. The main conjecture towards which…
A new algorithm for the determination of the relative convex hull in the plane of a simple polygon A with respect to another simple polygon B which contains A, is proposed. The relative convex hull is also known as geodesic convex hull, and…
A graph is diameter two edge-critical if its diameter is two and the deletion of any edge increases the diameter. Murty and Simon conjectured that the number of edges in a diameter two edge-critical graph on $n$ vertices is at most $\lfloor…
It is conjectured since long that for any convex body $P\subset \mathbb{R}^n$ there exists a point in its interior which belongs to at least $2n$ normals from different points on the boundary of $P$. The conjecture is known to be true for…
Piecewise-linear (PL) Morse theory and discrete Morse theory are used in shape analysis tasks to investigate the topological features of discretized spaces. In spite of their common origin in smooth Morse theory, various notions of critical…
For critical bond-percolation on high-dimensional torus, this paper proves sharp lower bounds on the size of the largest cluster, removing a logarithmic correction in the lower bound in Heydenreich and van der Hofstad (2007). This…
Chv\'{a}tal and Klincsek (1980) gave an $O(n^3)$-time algorithm for the problem of finding a maximum-cardinality convex subset of an arbitrary given set $P$ of $n$ points in the plane. This paper examines a generalization of the problem,…
The investigation of combinatorial diameters of polyhedra is a classical topic in linear programming due to its connection with the possibility of an efficient pivot rule for the simplex method. We are interested in the diameters of…
The log-rank conjecture is a longstanding open problem with multiple equivalent formulations in complexity theory and mathematics. In its linear-algebraic form, it asserts that the rank and partitioning number of a Boolean matrix are…
In this paper, we present two main results. First, by only one conjecture (Conjecture 2.9) for recognizing a vertex symmetric graph, which is the hardest task for our problem, we construct an algorithm for finding an isomorphism between two…
Many problems in combinatorial geometry can be formulated in terms of curves or surfaces containing many points of a cartesian product. In 2000, Elekes and R\'onyai proved that if the graph of a polynomial contains $cn^2$ points of an…
We classify all tuples of lattice polyhedra of relative mixed volume 1 and all minimal (by inclusion) tuples of polyhedra of relative mixed volume 2. We also prove a conjecture by A. Esterov, which states that all tuples with finite…
Kontsevich's graphs from deformation quantisation allow encoding multi-vectors whose coefficients are differential-polynomial in components of Poisson brackets on finite-dimensional affine manifolds. The calculus of Kontsevich graphs can be…
In 1996 Sabitov proved that the volume of an arbitrary simplicial polyhedron P in the 3-dimensional Euclidean space $\R^3$ satisfies a monic (with respect to V) polynomial relation F(V,l)=0, where l denotes the set of the squares of edge…