Related papers: Sunflowers and Ramsey problems for restricted inte…
Breaking of equivalence between the microcanonical ensemble and the canonical ensemble, describing a large system subject to hard and soft constraints, respectively, was recently shown to occur in large random graphs. Hard constraints must…
The classical Erd\H{o}s-Ko-Rado theorem on the size of an intersecting family of $k$-subsets of the set $[n] = \{1, 2, \dots, n\}$ is one of the fundamental intersection theorems for set systems. After the establishment of the EKR theorem,…
A recent question in generalized Ramsey theory is that for fixed positive integers $s\leq t$, at least how many vertices can be covered by the vertices of no more than $s$ monochromatic members of the family $\cal F$ in every edge coloring…
To study how balanced or unbalanced a maximal intersecting family $\mathcal{F}\subseteq \binom{[n]}{r}$ is we consider the ratio $\mathcal{R}(\mathcal{F})=\frac{\Delta(\mathcal{F})}{\delta(\mathcal{F})}$ of its maximum and minimum degree.…
Let $\mathrm{R}$ be a real closed field. We prove that for any fixed $d$, the equivariant rational cohomology groups of closed symmetric semi-algebraic subsets of $\mathrm{R}^k$ defined by polynomials of degrees bounded by $d$ vanishes in…
We characterize non-perturbatively the R\'enyi entropies of degree n=2,3,4, and 5 of three-dimensional, strongly coupled many-fermion systems in the scale-invariant regime of short interaction range and large scattering length, i.e. in the…
We study the parameterized complexity of dominating sets in geometric intersection graphs. In one dimension, we investigate intersection graphs induced by translates of a fixed pattern Q that consists of a finite number of intervals and a…
We consider following geometric Ramsey problem: find the least dimension $n$ such that for any 2-coloring of edges of complete graph on the points $\{\pm 1\}^n$ there exists 4-vertex coplanar monochromatic clique. Problem was first analyzed…
Upper bounds to the size of a family of subsets of an n-element set that avoids certain configurations are proved. These forbidden configurations can be described by inclusion patterns and some sets having the same size. Our results are…
We consider a quantum mechanical particle living on a graph and discuss the behaviour of its wavefunction at graph vertices. In addition to the standard (or delta type) boundary conditions with continuous wavefunctions, we investigate two…
We survey recent (and not so recent) results concerning arrangements of lines, points and other geometric objects and the applications these results have in theoretical computer science and combinatorics. The three main types of problems we…
A fundamental problem in Ramsey theory is to determine the growth rate in terms of $n$ of the Ramsey number $r(H, K_n^{(3)})$ of a fixed $3$-uniform hypergraph $H$ versus the complete $3$-uniform hypergraph with $n$ vertices. We study this…
The Rainbow k-Coloring problem asks whether the edges of a given graph can be colored in $k$ colors so that every pair of vertices is connected by a rainbow path, i.e., a path with all edges of different colors. Our main result states that…
A $(k+r)$-uniform hypergraph $H$ on $(k+m)$ vertices is an $(r,m,k)$-daisy if there exists a partition of the vertices $V(H)=K\cup M$ with $|K|=k$, $|M|=m$ such that the set of edges of $H$ is all the $(k+r)$-tuples $K\cup P$, where $P$ is…
In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of $n$ definable sets belonging to some fixed definable family of sets in an o-minimal structure. This generalizes the…
We study the possibility of supersymmetry (SUSY) in quantum mechanics in one dimension under the presence of a point singularity. The system considered is the free particle on a line R or on the interval [-l, l] where the point singularity…
For random combinatorial optimization problems, there has been much progress in establishing laws of large numbers and computing limiting constants for the optimal value of various problems. However, there has not been as much success in…
We investigate Ramsey numbers of bounded degree graphs and provide an interpolation between known results on the Ramsey numbers of general bounded degree graphs and bounded degree graphs of small bandwidth. Our main theorem implies that…
A $\left(n,\ell,\gamma\right)$-sharing set family of size $m$ is a family of sets $S_1,\ldots,S_m\subseteq [n]$ s.t. each set has size $\ell$ and each pair of sets shares at most $\gamma$ elements. We let $m\left(n,\ell,\gamma\right)$…
We study problems related to colouring bottomless rectangles. One of our main results shows that for any positive integers $m, k$, there is no semi-online algorithm that can $k$-colour bottomless rectangles with disjoint boundaries in…