Related papers: Homotopy groups and quantitative Sperner-type lemm…

Fix an integer $k \ge 3$. A $k$-uniform hypergraph is simple if every two edges share at most one vertex. We prove that there is a constant $c$ depending only on $k$ such that every simple $k$-uniform hypergraph $H$ with maximum degree $\D$…

There are at least two ways to approach the homotopy theory of spaces `at chromatic height $n$': one may localize with respect to $T(n)$-homology or with respect to $v_n$-periodic homotopy groups. It was already observed by Bousfield that…

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…

Let $\mathbb{F}_p$ be the field with $p$ elements with $p$ prime, $X_1,\ldots, X_n$ pairwise disjoint subsets of $\mathbb{F}_p$with at least $3$ elements such that $\sum_{i=1}^n|X_i|\leq p-5$, and $\mathbb{S}_n$ the set of permutations of…

We consider a smooth submanifold $N$ with a smooth boundary in an ambient closed manifold $M$ and assign a spectral invariant $c(\alpha,H)$ to every singular homological class $\alpha\in H_*(N)$ and a Hamiltonian $H$ defined on the…

Given a simple biconnected planar cubic graph, we associate each its vertex among $2n$ ones with the so-called spin, i.e., a variable which takes on values $\pm 1$. P. J. Heawood has proved that a Tait coloring, accurate to the choice of a…

Let us denote by $\Phi(\lambda,\mu)$ the statement that $\mathbb{B}(\lambda) = D(\lambda)^\omega$, i.e. the Baire space of weight $\lambda$, has a coloring with $\mu$ colors such that every homeomorphic copy of the Cantor set $\mathbb{C}$…

Associated to an Hadamard matrix $H\in M_N(\mathbb C)$ is the spectral measure $\mu\in\mathcal P[0,N]$ of the corresponding Hopf image algebra, $A=C(G)$ with $G\subset S_N^+$. We study here a certain family of discrete measures…

For a positive integer $n$, the full transformation semigroup $T_n$ consists of all self maps of the set $\{1,\ldots,n\}$ under composition. Any finite semigroup $S$ embeds in some $T_n$, and the least such $n$ is called the (minimum…

We construct a stratification of the punctual Hilbert scheme of points on a non-reduced and nodal plane curve, $x^uy^v=0$. Each stratum is indexed by a new combinatorial object we define: a weak diagonal partition. The approach is based on…

We study algorithms for recursively creating arbitrary N-extended `supermultiplets' given minimal matrix representations of off-shell, N = 1 supermultiplet matrices. We observe connections between the color vertex problems in graph theory…

Thomason's Homotopy Colimit Theorem has been extended to bicategories and this extension can be adapted, through the delooping principle, to a corresponding theorem for diagrams of monoidal categories. In this version, we show that the…

One of the classical notions of group theory is the notion of the exponent of a group. The exponent of a group is the least common multiple of orders of its elements. In this paper we generalize the notion of exponent to Hopf algebras. We…

A tri-colored sum-free set in an abelian group $H$ is a collection of ordered triples in $H^3$, $\{(a_i,b_i,c_i)\}_{i=1}^m$, such that the equation $a_i+b_j+c_k=0$ holds if and only if $i=j=k$. Using a variant of the lemma introduced by…

We prove that with high probability over the choice of a random graph $G$ from the Erd\H{o}s-R\'enyi distribution $G(n,1/2)$, a natural $n^{O(\varepsilon^2 \log n)}$-time, degree $O(\varepsilon^2 \log n)$ sum-of-squares semidefinite program…

In this paper, we explore algebraic approaches to $d$-improper and $t$-clustered colourings, where the colouring constraints are relaxed to allow some monochromatic edges. Bilu [J. Comb. Theory Ser. B, 96(4):608-613, 2006] proved a…

We study Hopf algebras via tools from geometric invariant theory. We show that all the invariants we get can be constructed using the integrals of the Hopf algebra and its dual together with the multiplication and the comultiplication, and…

A graph G is (a:b)-colorable if there exists an assignment of b-element subsets of {1,...,a} to vertices of G such that sets assigned to adjacent vertices are disjoint. We first show that for every triangle-free planar graph G and a vertex…

The Hom complex ${\rm Hom}(T,G)$ of graphs is a CW-complex associated to a pair of graphs $T$ and $G$, considered in the graph coloring problem. It is known that certain homotopy invariants of ${\rm Hom}(T,G)$ give lower bounds for the…

Let $(G,\pmb{+})$ be any given semimodule over a discrete semiring $(R,+,\cdot)$ with a finite coloring, say $G=B_1\cup\dotsm\cup B_q$. By establishing a Regional Multiple Recurrence Theorem for semimodules, we prove that one of the colors…