相关论文: Box complexes, neighborhood complexes, and the chr…

In this article, we study the topological complexity of manifolds with a lower scalar curvature bound. We introduce a small scale index theorem to establish an upper bound for Gromov's simplicial norm of the Poincar\'e dual of the A-hat…

We reduce the problem of proving deterministic and nondeterministic Boolean circuit size lower bounds to the analysis of certain two-dimensional combinatorial cover problems. This is obtained by combining results of Razborov (1989),…

Based on the algorithmic proof of Lov\'asz local lemma due to Moser and Tardos, the works of Grytczuk et al. on words, and Dujmovi\'c et al. on colorings, Esperet and Parreau developed a framework to prove upper bounds for several chromatic…

We prove a generalization of the classical Borsuk--Ulam Theorem under small perturbations (shaking) of the sphere. We show that for a generic perturbation of a continuous map $f : S^2 \to \mathbb{R}^2$, the number of points $x \in S^2$ such…

In this paper we study a pair of numerical parameters associated to a graph $G$. One the one hand, one can construct $\text{Hom}(K_2, G)$, a space of homomorphisms from a edge $K_2$ into $G$ and study its (topological) connectivity. This…

In this paper, we prove an extension of the noncompact version of Llarull's theorem due to Zhang and Li-Su-Wang-Zhang, giving an upper bound for the infimum of scalar curvature in terms of the bottom spectrum of the Laplacian. Moreover, we…

We define the independence ratio and the chromatic number for bounded, self-adjoint operators on an L^2-space by extending the definitions for the adjacency matrix of finite graphs. In analogy to the Hoffman bounds for finite graphs, we…

In 1975 Lov\'{a}sz conjectured that every $r$-partite, $r$-uniform hypergraph contains $r-1$ vertices whose deletion reduces the matching number. If true, this statement would imply a well-known conjecture of Ryser from 1971, which states…

We extend the Ax-Katz theorem for a single polynomial from finite fields to the rings Z_m with m composite. This extension not only yields the analogous result, but gives significantly higher divisibility bounds. We conjecture what computer…

We show that there is no simple (e.g. finite or countable) basis for Borel graphs with infinite Borel chromatic number. In fact, it is proved that the closed subgraphs of the shift graph on $[\mathbb{N}]^{<\mathbb{N}}$ with finite (or,…

Let $S=\{n_1,n_2,...,n_t\}$ be a finite set of positive integers with $\min(S)\geq 3$ and $t\geq 2$. For any positive integers $s_1,s_2,...,s_t$, we construct a family of 3-uniform bi-hypergraphs ${\cal H}$ with the feasible set $S$ and…

We study the relationship between hyperfiniteness and problems in Borel graph combinatorics by adapting game-theoretic techniques introduced by Marks to the hyperfinite setting. We compute the possible Borel chromatic numbers and edge…

We prove a query complexity variant of the weak polynomial Freiman-Ruzsa conjecture in the following form. For any $\epsilon > 0$, a set $A \subset \mathbb{Z}^d$ with doubling $K$ has a subset of size at least $K^{-\frac{4}{\epsilon}}|A|$…

we derive new, improved lower bounds for the block complexity of an irrational algebraic number and for the number of digit changes in the b-ary expansion of an irrational algebraic number. To this end, we apply a quantitative version of…

We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…

We apply Cauchy's interlacing theorem to derive some eigenvalue bounds to the chromatic number using the normalized Laplacian matrix, including a combinatorial characterization of when equality occurs. Further, we introduce some new…

In this paper, we introduce the notion of "$Lucas-Coloring$" associated with a planar graph $g$. When $g$ is a $4$-regular, the enumeration of $Lucas-Coloring$ has an interesting interpretation. Specifically, it yields a numerical invariant…

The aim of this paper is to generalize the notion of the coloring complex of a graph to hypergraphs. We present three different interpretations of those complexes -- a purely combinatorial one and two geometric ones. It is shown, that most…

Combinatorial discrepancy is a complexity measure of a collection of sets which quantifies how well the sets in the collection can be simultaneously balanced. More precisely, we are given an n-point set $P$, and a collection $\mathcal{F} =…

We show that the n-th power of the first Stiefel-Whitney class of the Z_2-operation on the graph complex Hom(C_{2r+1},K_{n+2})$ is zero, confirming a conjecture by Babson and Kozlov. This proves the strong form of their graph colouring…