English
Related papers

Related papers: Broken family sensitivity in transitive systems

200 papers

Let $n$, $k$ and $t$ be positive integers, and let $\mathcal{F}$ be a collection of $k$-subsets of $[n]=\{1,2,\dots,n\}$. The $t$-covering number $\tau_t(\mathcal{F})$ of $\mathcal{F}$ is defined as the minimum size of a set $T$ such that…

Combinatorics · Mathematics 2026-05-20 Yu Zhu , Benjian Lv , Kaishun Wang

Let $\mathcal{F}\subseteq{[n]\choose k}$ be a $t$-intersecting family. Define the $t$-covering number $\tau_t(\mathcal{F})$ of $\mathcal{F}$ as the minimum size of a subset $S$ of $[n]$ with $|S\cap F|\geqslant t$ for each…

Combinatorics · Mathematics 2026-03-12 Tian Yao , Dehai Liu , Kaishun Wang

We say that a set system $\mathcal{F}\subseteq 2^{[n]}$ shatters a given set $S\subseteq [n]$ if $2^S= \{F~\cap~S:~F~\in~\mathcal{F}\}$. The Sauer-Shelah lemma states that in general, a set system $\mathcal{F}$ shatters at least…

Combinatorics · Mathematics 2017-10-10 Christopher Kusch , Tamás Mészáros

The families $\mathcal{A}$ and $\mathcal{B}$ are cross intersecting if $A\cap B\ne \emptyset$ for any $A\in \mathcal{A}$ and $B\in \mathcal{B}$. Let $t\geq 2$ and $k_1\geq k_2\geq \cdots \geq k_t$. We say that $(\mathcal{F}_1, \dots,…

Combinatorics · Mathematics 2026-01-06 Yang Huang , Yuejian Peng

Let $(X, T)$ be a topological dynamical system. Denote by $h (T, K)$ and $h^B (T, K)$ the covering entropy and dimensional entropy of $K\subseteq X$, respectively. $(X, T)$ is called D-{\it lowerable} (resp. {\it lowerable}) if for each…

Dynamical Systems · Mathematics 2013-06-21 Wen Huang , Xiangdong Ye , Guohua Zhang

Given a semigroup $G$ and a bounded function $f: G \to \mathbb{C}$, a topological Furstenberg system of $f$ is a topological dynamical system $\mathbb{X}=(X, (T_g)_{g \in G})$ that encodes the dynamical behaviour of $f$. We show that…

Dynamical Systems · Mathematics 2026-03-31 Ioannis Kousek , Vicente Saavedra-Araya

A finite family $\mathrsfs{F}$ of subsets of a finite set $X$ is union-closed whenever $f,g\in\mathrsfs{F}$ implies $f\cup g\in\mathrsfs{F}$. These families are well known because of Frankl's conjecture. In this paper we developed further…

Combinatorics · Mathematics 2012-10-16 Emanuele Rodaro

Set systems with strongly restricted intersections, called $\alpha$-intersecting families for a vector $\alpha$, were introduced recently as a generalization of several well-studied intersecting families including the classical oddtown and…

Combinatorics · Mathematics 2024-04-15 Xin Wei , Xiande Zhang , Gennian Ge

Let $n$, $r$, $k_1,\ldots,k_r$ and $t$ be positive integers with $r\geq 2$, and $\mathcal{F}_i\ (1\leq i\leq r)$ a family of $k_i$-subsets of an $n$-set $V$. The families $\mathcal{F}_1,\ \mathcal{F}_2,\ldots,\mathcal{F}_r$ are said to be…

Combinatorics · Mathematics 2022-05-24 Mengyu Cao , Mei Lu , Benjian Lv , Kaishun Wang

In the paper, we study behavior of discrete dynamical systems (automata) w.r.t. transitivity; that is, speaking loosely, we consider how diverse may be behavior of the system w.r.t. variety of word transformations performed by the system:…

Dynamical Systems · Mathematics 2014-03-05 Vladimir Anashin

We obtain new bounds for (a variant of) the Furstenberg set problem for high dimensional flats over $\mathbb{R}^n$. In particular, let $F\subset \mathbb{R}^n$, $1\leq k \leq n-1$, $s\in (0,k]$, and $t\in (0,k(n-k)]$. We say that $F$ is a…

Classical Analysis and ODEs · Mathematics 2025-03-14 Paige Bright , Manik Dhar

The aim of this research is to introduce the notion of multi-transitivity in non-autonomous discrete dynamical systems(NDDS) with respect to a vector. Necessary and sufficient conditions are obtained under which a NDDS is multitransitive…

Functional Analysis · Mathematics 2023-05-26 Neelam Shah Jahan

For $k\geq3$, a collection of $k$ sets is said to form a \emph{weak $\Delta$-system} if the intersection of any two sets from the collection has the same size. Erd\H{o}s and Szemer\'{e}di asked about the size of the largest family…

Combinatorics · Mathematics 2023-01-24 Eric Naslund

Let $\bm X=(X_1,...,X_d)$ be a random vector, whose components are not necessarily independent nor are they required to have identical distribution functions $F_1,...,F_d$. Denote by $N_s$ the number of exceedances among $X_1,...,X_d$ above…

Statistics Theory · Mathematics 2012-02-09 Michael Falk , Diana Tichy

Given a union-closed family $\mathcal{F}$ of subsets of the universe $[n]$, with $\mathcal{F}$ not equal to the power set of $[n]$, a new subset $A$ can be added to it such that the resulting family remains union-closed. We construct a new…

Combinatorics · Mathematics 2021-04-20 Dhruv Bhasin

Let $\mathbb N_0$ be the set of non-negative integers, and let $P(n,l)$ denote the set of all weak compositions of $n$ with $l$ parts, i.e., $P(n,l)=\{ (x_1,x_2,\dots, x_l)\in\mathbb N_0^l\ :\ x_1+x_2+\cdots+x_l=n\}$. For any element…

Combinatorics · Mathematics 2013-11-08 Kok Bin Wong , Cheng Yeaw Ku

Let $t=t_1t_2\cdots$ be an element of the full shift with shift map $\tau$ on a finite set of characters $\mathcal{A}$ and let $ \Sigma=\text{ closure} \{\tau^i(t):\;i\in\N\cup\{0\}\}$. Let $f_t=f_{t_1,\,\infty}=\cdots\circ f_{t_2}\circ…

Dynamical Systems · Mathematics 2022-06-22 Dawoud Ahmadi Dastjerdi , Mahdi Aghaee

Let $G$ be a countable discrete group. We give a necessary and sufficient condition for a transitive $G$-system to be disjoint with all minimal $G$-systems, which implies that if a transitive $G$-system is disjoint with all minimal…

Dynamical Systems · Mathematics 2024-08-12 Hui Xu , Xiangdong Ye

Symmetry-breaking transitions are a well-understood phenomenon of closed quantum systems in quantum optics, condensed matter, and high energy physics. However, symmetry breaking in open systems is less thoroughly understood, in part due to…

In this paper, we address several intersection problems for $r$-cross $t$-intersecting families of partitions. A $k$-partition of an $n$-set $X$ is a set of $k$ pairwise disjoint non-empty subsets whose union is $X$. For $1\leq i\leq r$,…

Combinatorics · Mathematics 2026-02-24 Jie Wen , Benjian Lv