中文
相关论文

相关论文: On the typical values of the cross-correlation mea…

200 篇论文

The fluctuations of massless Dirac fermion can not only turn a first-order bosonic phase transition (in the Landau sense) to a quantum critical point, but also work reversely to enhance the first-order transition itself, depending on the…

强关联电子 · 物理学 2021-03-03 Yuzhi Liu , Zi Yang Meng , Shuai Yin

In this paper we develop a new approach for studying overlapping iterated function systems. This approach is inspired by a famous result due to Khintchine from Diophantine approximation. This result shows that for a family of limsup sets,…

动力系统 · 数学 2020-10-20 Simon Baker

Two families $\mathcal{A}$ and $\mathcal{B}$ of sets are called cross-intersecting if each pair of sets $A\in \mathcal{A}$ and $B\in \mathcal{B}$ has nonempty intersection. Let $\cal{A}$ and ${\cal B}$ be two cross-intersecting families of…

组合数学 · 数学 2024-11-26 Biao Wu , Huajun Zhang

Let $k\geq 2$ and $n\geq 3(k-1)$. Let $\mathcal{F}$ and $\mathcal{G}$ be families of $k$-element subsets of an $n$-element set. Suppose that $|F\cap G|\geq 2$ for all $F\in\mathcal{F}$ and $G\in\mathcal{G}$. We show that…

组合数学 · 数学 2025-03-20 Hajime Tanaka , Norihide Tokushige

The Union-Closed Sets Conjecture, also known as Frankl's conjecture, asks whether, for any union-closed set family $\mathcal{F}$ with $m$ sets, there is an element that lies in at least $\frac{1}{2}\cdot m$ sets in $\mathcal{F}$. In 2022,…

组合数学 · 数学 2024-12-10 Saintan Wu

For an $n$-element set $X$ let $\binom{X}{k}$ be the collection of all its $k$-subsets. Two families of sets $\mathcal A$ and $\mathcal B$ are called cross-intersecting if $A\cap B \neq \emptyset$ holds for all $A\in\mathcal A$,…

组合数学 · 数学 2019-05-21 Peter Frankl , Andrey Kupavskii

The Kolakoski sequence is the unique infinite sequence with values in $\{1,2\}$ and first term $1$ which equals the sequence of run-lengths of itself, we call this $K(1,2).$ We define $K(m,n)$ similarly. A well-known conjecture is that the…

组合数学 · 数学 2017-04-25 Bobby Shen

Ever since the famous Erd\H{o}s-Ko-Rado theorem initiated the study of intersecting families of subsets, extremal problems regarding intersecting properties of families of various combinatorial objects have been extensively investigated.…

组合数学 · 数学 2021-01-12 Xiangliang Kong , Yuanxiao Xi , Bingchen Qian , Gennian Ge

We apply percolation theory to a recently proposed measure of fragmentation $F$ for social networks. The measure $F$ is defined as the ratio between the number of pairs of nodes that are not connected in the fragmented network after…

无序系统与神经网络 · 物理学 2007-05-23 Yiping Chen , Gerald Paul , Reuven Cohen , Shlomo Havlin , Stephen P. Borgatti , Fredrik Liljeros , H. Eugene Stanley

We investigate joint spectral characteristics of a family of matrices $\mathcal F $, associated with products in the semigroup generated by $\mathcal F$. In the literature, extremal measures such as the well-known joint spectral radius and…

动力系统 · 数学 2026-04-27 Francesco Paolo Maiale , Anastasiia Trofimova , Nicola Guglielmi

This paper addresses the following general scenario: A scientist wishes to perform a battery of experiments, each generating a sequential stream of data, to investigate some phenomenon. The scientist would like to control the overall error…

统计方法学 · 统计学 2014-05-12 Jay Bartroff , Jinlin Song

Let $V$ be an $n$-dimensional vector space over the finite field $\mathbb{F}_q$, and ${V\brack k}$ denote the family of all $k$-dimensional subspaces of $V$. The families $\mathcal{F}_1\subseteq{V\brack k_1},\mathcal{F}_2\subseteq{V\brack…

组合数学 · 数学 2022-01-19 Mengyu Cao , Mei Lu , Benjian Lv , Kaishun Wang

More than 50 years ago, Erd\H os asked the following question: what is the maximum size of a family $\mathcal F$ of $k$-element subsets of an $n$-element set if it has no $s+1$ pairwise disjoint sets? This question attracted a lot of…

组合数学 · 数学 2021-09-14 Peter Frankl , Andrey Kupavskii

Spread spectrum multiple access systems demand minimum possible cross-correlation between the sequences within a set of sequences having good auto-correlation properties. Through a connection between generalised Frank sequences and…

信息论 · 计算机科学 2023-08-10 Dan Zhang , Staal A. Vinterbo

In 2009, Grant, Shallit, and Stoll constructed a large family of pseudorandom sequences, called generalized Rudin--Shapiro sequences, for which they established some results about the average of discrete correlation coefficients of order 2…

数论 · 数学 2020-02-28 Pierre-Adrien Tahay

We introduce the coverage correlation coefficient, a novel nonparametric measure of statistical association designed to quantifies the extent to which two random variables have a joint distribution concentrated on a singular subset with…

统计方法学 · 统计学 2025-08-18 Xuzhi Yang , Mona Azadkia , Tengyao Wang

We propose a family of association measures for two-way contingency tables whose latent distribution can be assumed to be bivariate normal. When this assumption holds, the power-divergence measuring departure from independence can be…

统计方法学 · 统计学 2026-04-16 Wataru Urasaki

We use Fourier analysis to access risk in financial products. With it we analyze price changes of e.g. stocks. Via Fourier analysis we scrutinize quantitatively whether the frequency of change is higher than a change in (conserved) company…

统计金融 · 定量金融 2024-08-21 Michael Grabinski , Galiya Klinkova

Let $\mathcal{F}$ be a family of subsets of $[n]=\{1,\ldots,n\}$ and let $L$ be a set of nonnegative integers. The family $\mathcal{F}$ is \emph{$L$-intersecting} if $|F\cap F'|\in L$ for every two distinct members $F,F'\in\mathcal{F}$; and…

组合数学 · 数学 2018-11-29 Yandong Bai , Binlong Li , Jiuqiang Liu , Shenggui Zhang

We study the function $M(n,k)$ which denotes the number of maximal $k$-uniform intersecting families $F\subseteq \binom{[n]}{k}$. Improving a bound of Balogh at al. on $M(n,k)$, we determine the order of magnitude of $\log M(n,k)$ by…

组合数学 · 数学 2015-04-14 Zoltán Lóránt Nagy , Balázs Patkós