相关论文: Borel selector for hypergraphons

We prove a model-theoretic representation theorem for the distribution of an ergodic exchangeable $k$-uniform hypergraph: every such measure arises as the pushforward of the countably-iterated Morley product of a global Borel-definable…

A $k$-uniform hypergraph (or $k$-graph) $H = (V, E)$ is $k$-partite if $V$ can be partitioned into $k$ sets $V_1, \ldots, V_k$ such that each edge in $E$ contains precisely one vertex from each $V_i$. We show that $k$-partite $k$-graphs of…

We study several extensions of the notion of perfect graphs to $k$-uniform hypergraphs.

We prove that the so-called uniadic graph and its adic automorphism are Borel universal, i.e., every aperiodic Borel automorphism is isomorphic to the restriction of this automorphism to a subset invariant under the adic transformation, the…

We propose a new representation of $k$-partite, $k$-uniform hypergraphs, that is, a hypergraph with a partition of vertices into $k$ parts such that each hyperedge contains exactly one vertex of each type; we call them $k$-hypergraphs for…

We study the isomorphism problem for random hypergraphs. We show that it is solvable in polynomial time for the binomial random $k$-uniform hypergraph $H_{n,p;k}$, for a wide range of $p$. We also show that it is solvable w.h.p. for random…

We provide a deterministic polynomial-time algorithm that, for a given $k$-uniform hypergraph $H$ with $n$ vertices and edge density $d$, finds a complete $k$-partite subgraph of $H$ with parts of size at least ${c(d, k)(\log…

We present the effective version of the theorem about turning Borel sets in Polish spaces into clopen sets while preserving the Borel structure of the underlying space. We show that under some conditions the emerging parameters can be…

The paper is devoted to invariant theory problems. In particular, to the problem of finding generators of invariant fields in an explicit form. The set of generators is given for invariant field of unitriangular group of adjoint…

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 consider the class of {\em separable} $k$-hypergraphs, which can be viewed as uniform analogs of threshold Boolean functions, and the class of {\em equatable} $k$-hypergraphs. We show that every $k$-hypergraph is either separable or…

Here we give a short, concise proof for the following result. There exists a $k$-uniform hypergraph $H$ (for $k\geq 5$) without exponent, i.e., when the Tur\'an function is not polynomial in $n$. More precisely, we have $ex(n,H)=o(n^{k-1})$…

An orthogonal representation of a graph is an assignment of nonzero real vectors to its vertices such that distinct non-adjacent vertices are assigned to orthogonal vectors. We prove general lower bounds on the dimension of orthogonal…

We answer a recent question of Cs\'oka and Vidny\'anszky [arXiv:2407.10006] and give an alternate proof of one of their results. The subject of both is which finite graphs admit factor of i.i.d. homomorphisms from the 3-regular tree. We…

Let G be a reductive algebraic group over a field k and let B be a Borel subgroup in G. We demonstrate how a number of results on the cohomology of line bundles on the flag manifold G/B have had interesting consequences in the…

In this article we extend the notion of determinantal representation of hypersurfaces to the determinantal representation of sections of the determinant line bundle of a vector bundle. We give several examples, and prove some necessary…

Functor morphing provides a method to translate complex representations of automorphism groups of finite modules over finite rings to representations of automorphism groups of functors in some abelian category. In this paper we give an…

A $k$-uniform hypergraph (or $k$-graph) $H = (V, E)$ is $k$-partite if $V$ can be partitioned into $k$ sets $V_1, \ldots, V_k$ such that each edge in $E$ contains precisely one vertex from each $V_i$. In this note, we consider list…

A graph is called $k$-representable if there exists a word $w$ over the nodes of the graph, each node occurring exactly $k$ times, such that there is an edge between two nodes $x,y$ if and only after removing all letters distinct from…

We investigate when a Borel graph admits a (Borel or measurable) orientation with outdegree bounded by $k$ for various cardinals $k$. We show that for a p.m.p. graph $G$, a measurable orientation can be found when $k$ is larger than the…