Search arXivSearch

arXiv · 2603.25007

Bollobás-type inequalities for subspaces via weight invariance

Abstract

Let $V$ be an $n$-dimension real vector space with a direct sum decomposition $V = V_1 \oplus \cdots \oplus V_r$. Let $\mathcal{P} = \{(A_i, B_i) : i \in [m]\}$ be a skew Bollobás system of subspaces of $V$ such that each $i\in [m]$, $ A_i = \bigoplus_{k=1}^r (A_i \cap V_k)$ and $ B_i = \bigoplus_{k=1}^r (B_i \cap V_k)$. We prove that $$\sum_{i=1}^{m} \prod_{k=1}^{r} \left[ \binom{a_{i,k} + b_{i,k}}{a_{i,k}} (1 + a_{i,k} + b_{i,k})^{-1} \right] \leq 1,$$ where $a_{i,k} = \dim(A_i \cap V_k)$ and $b_{i,k} = \dim(B_i \cap V_k)$. This extends a recent result of Yue from set systems to finite dimensional subspaces. We then consider Tuza's theorem on weak Bollobás system for $d$-tuples. We give an alternative proof of the original set version of Tuza, and also establish its vector space analogue. Precisely, let $\mathcal{P} = \{(A_i^{(1)}, \ldots, A_i^{(d)}) : i \in [m]\}$ be a skew Bollobás system of $d$-tuples of subspaces of finite dimensional space $V$ with $a^{(\ell)}_i=\dim (A_i^{(\ell)})$. Then, for any positive real numbers $p_1, \ldots, p_d$ satisfying $p_1 + \cdots + p_d = 1$, we prove that $ \sum_{i=1}^{m} \prod_{\ell=1}^{d} p_{\ell}^{a_i^{(\ell)}} \leq 1. $

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zhiyi Liu, Lihua Feng, Tingzeng Wu. 2026-03-26. Bollobás-type inequalities for subspaces via weight invariance. https://arxiv.org/abs/2603.25007

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO