Related papers: Borel selector for hypergraphons

The author constructs the moduli of representations whose images generate the subalgebra of upper triangular matrices (up to inner automorphisms) of the full matrix ring for any groups and any monoids.

In this paper we investigate the sensitivity complexity of hypergraph properties. We present a $k$-uniform hypergraph property with sensitivity complexity $O(n^{\lceil k/3\rceil})$ for any $k\geq3$, where $n$ is the number of vertices.…

A set $A$ of vertices in an $r$-uniform hypergraph $\mathcal H$ is covered in $\mathcal H$ if there is some vertex $u\not\in A$ such that, for every $(r-1)$-set $B\subset A$, the set $\{u\}\cup B$ is in $\mathcal H$. Erdos and Moser (1970)…

We propose a theory of combinatorially explicit Schubert polynomials which represent the Schubert classes in the Borel presentation of the cohomology ring of orthogonal flag varieties. We use these polynomials to describe the arithmetic…

Every better quasi-order codifies a Borel graph that does not contain a copy of the shift graph. It is known that there is a better quasi-order that codes a Borel graph with infinite Borel chromatic number, though one has yet to be…

In Graph Minor III, Robertson and Seymour conjecture that the tree-width of a planar graph and that of its dual differ by at most one. We prove that given a hypergraph H on a surface of Euler genus k, the tree-width of H^* is at most the…

Let $X$ be an algebraic variety over $\mathbb{C}$. We say that $X$ is Borel hyperbolic if, for every finite type reduced scheme $S$ over $\mathbb{C}$, every holomorphic map $S^{an}\to X^{an}$ is algebraic. We use a transcendental…

We reduce the isomorphism problem for undirected graphs without loops to the isomorphism problems for a class of finite dimensional $2$-step nilpotent Lie algebras over a field and for a class of finite $p$-groups. We show that the…

The quantum supergroup OSPq(1|2n) is studied systematically. A Haar functional is constructed, and an algebraic version of the Peter - Weyl theory is extended to this quantum supergroup. Quantum homogeneous superspaces and quantum…

A famous result by R\"odl, Ruci\'nski, and Szemer\'edi guarantees a (tight) Hamilton cycle in $k$-uniform hypergraphs $H$ on $n$ vertices with minimum $(k-1)$-degree $\delta_{k-1}(H)\geq (1/2+o(1))n$, thereby extending Dirac's result from…

We prove the Borel Conjecture for a class of groups containing word-hyperbolic groups and groups acting properly, isometrically and cocompactly on a finite dimensional CAT(0)-space.

Fix $k \geq 3$, and let $G$ be a $k$-uniform hypergraph with maximum degree $\Delta$. Suppose that for each $l = 2, ..., k-1$, every set of l vertices of G is in at most $\Delta^{(k-l)/(k-1)}/f$ edges. Then the chromatic number of $G$ is…

This paper provides a survey of methods, results, and open problems on graph and hypergraph colourings, with a particular emphasis on semi-random `nibble' methods. We also give a detailed sketch of some aspects of the recent proof of the…

Let K be a field and G a split connected reductive affine algebraic K-group. Let T be a split maximal torus of G, W its finite Weyl group, and R its root system. After fixing a realization of R in G and choosing a simple system for R, one…

The focus of this article is to develop computationally efficient mathematical morphology operators on hypergraphs. To this aim we consider lattice structures on hypergraphs on which we build morphological operators. We develop a pair of…

Unigraphs are graphs uniquely determined by their own degree sequence up to isomorphism. There are many subclasses of unigraphs such as threshold graphs, split matrogenic graphs, matroidal graphs, and matrogenic graphs. Unigraphs and these…

The K-partitioning problem consists of partitioning the vertices of a graph in K sets so as to minimize a function of the edge weights. We introduce a linear mixed integer formulation with edge variables and representative variables. We…

Two different constructions of an invariant of an odd dimensional hyperbolic manifold in the K-group $K_{2n-1}(\bar \Bbb Q)\otimes \Bbb Q$ are given. The volume of the manifold is equal to the value of the Borel regulator on that element.…

For each uniformity $k \geq 3$, we construct $k$-uniform linear hypergraphs $G$ with arbitrarily large maximum degree $\Delta$ whose independence polynomial $Z_G$ has a root $\lambda$ with $\lvert\lambda\rvert = O\left(\frac{\log…

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$…