Related papers: A Generalization of Arrow's Impossibility Theorem …
In this paper we prove two results, one semi-historical and the other new. The semi-historical result, which goes back to Thurston and Riley, is that the geometrization theorem implies that there is an algorithm for the homeomorphism…
In this paper, we investigate analytically the properties of the disordered Bernoulli model of planar matching. This model is characterized by a topological phase transition, yielding complete planar matching solutions only above a critical…
An archetypal problem discussed in computer science is the problem of searching for a given number in a given set of numbers. Other than sequential search, the classic solution is to sort the list of numbers and then apply binary search.…
Recent work on distributed graph algorithms [e.g. STOC 2022, ITCS 2022, PODC 2020] has drawn attention to the following open question: are round elimination fixed points a universal technique for proving lower bounds? That is, given a…
Razborov's flag algebra forms a powerful framework for deriving asymptotic inequalities between induced subgraph densities, underpinning many advances in extremal graph theory. This survey introduces flag algebra to computer scientists…
Graphs are a natural representation for systems based on relations between connected entities. Combinatorial optimization problems, which arise when considering an objective function related to a process of interest on discrete structures,…
We present a surprisingly new connection between two well-studied combinatorial classes: rooted connected chord diagrams on one hand, and rooted bridgeless combinatorial maps on the other hand. We describe a bijection between these two…
J. Lepowsky and R. L. Wilson initiated the approach to combinatorial Rogers-Ramanujan type identities via the vertex operator constructions of representations of affine Lie algebras. In a joint work with Arne Meurman this approach is…
Based on a quantitative version of the classical Hopf-Rinow theorem in terms of the doubling property, we prove new precompactness principles in the (pointed) Gromov-Hausdorff topology for domains in (maybe incomplete) Riemannian manifolds…
We introduce in this section an Algebraic and Combinatorial approach to the theory of Numbers. The approach rests on the observation that numbers can be identified with familiar combinatorial objects namely rooted trees, which we shall here…
This paper initiates the reverse mathematics of social choice theory, studying Arrow's impossibility theorem and related results including Fishburn's possibility theorem and the Kirman--Sondermann theorem within the framework of reverse…
We prove multiple generalizations of Fan's combinatorial labeling result for sphere triangulations. This can be seen as a comprehensive extension of the Borsuk--Ulam theorem. In typical applications, the Borsuk--Ulam theorem gives…
Given a simplicial complex and a collection of subcomplexes covering it, the nerve theorem, a fundamental tool in topological combinatorics, guarantees a certain connectivity of the simplicial complex when connectivity conditions on the…
The field of analytic combinatorics is dedicated to the creation of effective techniques to study the large-scale behaviour of combinatorial objects. Although classical results in analytic combinatorics are mainly concerned with univariate…
Representing a proof tree by a combinator term that reduces to the tree lets subtle forms of duplication within the tree materialize as duplicated subterms of the combinator term. In a DAG representation of the combinator term these…
We explain how to see finite combinatorics of preorders implicit in the {text} of basic topological definitions or arguments in (Bourbaki, General topology, Ch.I), and define a concise combinatorial notation such that complete definitions…
The notion of homomorphism indistinguishability offers a combinatorial framework for characterizing equivalence relations of graphs, in particular equivalences in counting logics within finite model theory. That is, for certain graph…
Using a long-standing conjecture from combinatorial group theory, we explore, from multiple perspectives, the challenges of finding rare instances carrying disproportionately high rewards. Based on lessons learned in the context defined by…
In 1989 H. Tverberg proposed a quite general conjecture in Discrete geometry, which could be considered as the common basis for many results in Combinatorial geometry and at the same time as a discrete analogue of the common transversal…
Can you decide if there is a coincidence in the numbers counting two different combinatorial objects? For example, can you decide if two regions in $\mathbb{R}^3$ have the same number of domino tilings? There are two versions of the…