scholarly journals Cross-Intersecting Families of Labeled Sets

10.37236/3047 ◽  
2013 ◽  
Vol 20 (1) ◽  
Author(s):  
Huajun Zhang

For two positive integers $n$ and $p$, let $\mathcal{L}_{p}$ be the family of labeled $n$-sets given by $$\mathcal{L}_{p}=\big\{\{(1,\ell_1),(2,\ell_2),\ldots,(n,\ell_n)\}: \ell_i\in[p], i=1,2\ldots,n\big\}.$$ Families $\mathcal{A}$ and $\mathcal{B}$ are said to be cross-intersecting if $A\cap B\neq\emptyset$ for all $A\in \mathcal{A}$ and $B\in\mathcal{B}$. In this paper, we will prove that for $p\geq 4$,  if $\mathcal{A}$ and $\mathcal{B}$ are cross-intersecting subfamilies of $\mathcal{L}_{\mathfrak{p}}$, then $|\mathcal{A}||\mathcal{B}|\leq p^{2n-2}$, and equality holds if and only if $\mathcal{A}$ and $\mathcal{B}$ are an identical largest intersecting subfamily of $\mathcal{L}_{p}$.

2014 ◽  
Vol 150 (7) ◽  
pp. 1077-1106 ◽  
Author(s):  
Zev Klagsbrun ◽  
Barry Mazur ◽  
Karl Rubin

AbstractWe study the distribution of 2-Selmer ranks in the family of quadratic twists of an elliptic curve $\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}E$ over an arbitrary number field $K$. Under the assumption that ${\rm Gal}(K(E[2])/K) \ {\cong }\ S_3$, we show that the density (counted in a nonstandard way) of twists with Selmer rank $r$ exists for all positive integers $r$, and is given via an equilibrium distribution, depending only on a single parameter (the ‘disparity’), of a certain Markov process that is itself independent of $E$ and $K$. More generally, our results also apply to $p$-Selmer ranks of twists of two-dimensional self-dual ${\bf F}_p$-representations of the absolute Galois group of $K$ by characters of order $p$.


2019 ◽  
Vol 28 (06) ◽  
pp. 826-839
Author(s):  
David Ellis ◽  
Noam Lifshitz

AbstractA family of sets is said to be intersecting if any two sets in the family have non-empty intersection. In 1973, Erdős raised the problem of determining the maximum possible size of a union of r different intersecting families of k-element subsets of an n-element set, for each triple of integers (n, k, r). We make progress on this problem, proving that for any fixed integer r ⩾ 2 and for any $$k \le ({1 \over 2} - o(1))n$$, if X is an n-element set, and $${\cal F} = {\cal F}_1 \cup {\cal F}_2 \cup \cdots \cup {\cal F}_r $$, where each $$ {\cal F}_i $$ is an intersecting family of k-element subsets of X, then $$|{\cal F}| \le \left( {\matrix{n \cr k \cr } } \right) - \left( {\matrix{{n - r} \cr k \cr } } \right)$$, with equality only if $${\cal F} = \{ S \subset X:|S| = k,\;S \cap R \ne \emptyset \} $$ for some R ⊂ X with |R| = r. This is best possible up to the size of the o(1) term, and improves a 1987 result of Frankl and Füredi, who obtained the same conclusion under the stronger hypothesis $$k < (3 - \sqrt 5 )n/2$$, in the case r = 2. Our proof utilizes an isoperimetric, influence-based method recently developed by Keller and the authors.


2009 ◽  
Vol 18 (1-2) ◽  
pp. 107-122 ◽  
Author(s):  
IRIT DINUR ◽  
EHUD FRIEDGUT

A family$\J$of subsets of {1, . . .,n} is called aj-junta if there existsJ⊆ {1, . . .,n}, with |J| =j, such that the membership of a setSin$\J$depends only onS∩J.In this paper we provide a simple description of intersecting families of sets. Letnandkbe positive integers withk<n/2, and let$\A$be a family of pairwise intersecting subsets of {1, . . .,n}, all of sizek. We show that such a family is essentially contained in aj-junta$\J$, wherejdoes not depend onnbut only on the ratiok/nand on the interpretation of ‘essentially’.Whenk=o(n) we prove that every intersecting family ofk-sets is almost contained in a dictatorship, a 1-junta (which by the Erdős–Ko–Rado theorem is a maximal intersecting family): for any such intersecting family$\A$there exists an elementi∈ {1, . . .,n} such that the number of sets in$\A$that do not containiis of order$\C {n-2}{k-2}$(which is approximately$\frac {k}{n-k}$times the size of a maximal intersecting family).Our methods combine traditional combinatorics with results stemming from the theory of Boolean functions and discrete Fourier analysis.


Author(s):  
Soumen Maity ◽  
Charles J. Colbourn

Covering arrays are combinatorial objects that have been successfully applied in design of test suites for testing systems such as software, hardware, and networks where failures can be caused by the interaction between their parameters. Let [Formula: see text] and [Formula: see text] be positive integers with [Formula: see text]. Two vectors [Formula: see text] and [Formula: see text] are qualitatively independent if for any ordered pair [Formula: see text], there exists an index [Formula: see text] such that [Formula: see text]. Let [Formula: see text] be a graph with [Formula: see text] vertices [Formula: see text] with respective vertex weights [Formula: see text]. A mixed covering array on[Formula: see text] , denoted by [Formula: see text], is a [Formula: see text] array such that row [Formula: see text] corresponds to vertex [Formula: see text], entries in row [Formula: see text] are from [Formula: see text]; and if [Formula: see text] is an edge in [Formula: see text], then the rows [Formula: see text] are qualitatively independent. The parameter [Formula: see text] is the size of the array. Given a weighted graph [Formula: see text], a mixed covering array on [Formula: see text] with minimum size is optimal. In this paper, we introduce some basic graph operations to provide constructions for optimal mixed covering arrays on the family of graphs with treewidth at most three.


2010 ◽  
Vol 06 (02) ◽  
pp. 219-245 ◽  
Author(s):  
JEFFREY C. LAGARIAS

This paper considers the cyclic system of n ≥ 2 simultaneous congruences [Formula: see text] for fixed nonzero integers (r, s) with r > 0 and (r, s) = 1. It shows there are only finitely many solutions in positive integers qi ≥ 2, with gcd (q1q2 ⋯ qn, s) = 1 and obtains sharp bounds on the maximal size of solutions for almost all (r, s). The extremal solutions for r = s = 1 are related to Sylvester's sequence 2, 3, 7, 43, 1807,…. If the positivity condition on the integers qi is dropped, then for r = 1 these systems of congruences, taken ( mod |qi|), have infinitely many solutions, while for r ≥ 2 they have finitely many solutions. The problem is reduced to studying integer solutions of the family of Diophantine equations [Formula: see text] depending on three parameters (r, s, m).


2012 ◽  
Vol 49 (01) ◽  
pp. 266-279
Author(s):  
Lasse Leskelä ◽  
Harri Varpanen

Juggler's exclusion process describes a system of particles on the positive integers where particles drift down to zero at unit speed. After a particle hits zero, it jumps into a randomly chosen unoccupied site. We model the system as a set-valued Markov process and show that the process is ergodic if the family of jump height distributions is uniformly integrable. In a special case where the particles jump according to a set-avoiding memoryless distribution, the process reaches its equilibrium in finite nonrandom time, and the equilibrium distribution can be represented as a Gibbs measure conforming to a linear gravitational potential.


10.37236/724 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Jun Wang ◽  
Huajun Zhang

Let $n, r$ and $\ell$ be distinct positive integers with $r < \ell\leq n/2$, and let $X_1$ and $X_2$ be two disjoint sets with the same size $n$. Define $$\mathcal{F}=\left\{A\in \binom{X}{r+\ell}: \mbox{$|A\cap X_1|=r$ or $\ell$}\right\},$$ where $X=X_1\cup X_2$. In this paper, we prove that if $\mathcal{S}$ is an intersecting family in $\mathcal{F}$, then $|\mathcal{S}|\leq \binom{n-1}{r-1}\binom{n}{\ell}+\binom{n-1}{\ell-1}\binom{n}{r}$, and equality holds if and only if $\mathcal{S}=\{A\in\mathcal{F}: a\in A\}$ for some $a\in X$.


10.37236/5782 ◽  
2016 ◽  
Vol 23 (4) ◽  
Author(s):  
Peter Borg

Two families $\mathcal{A}$ and $\mathcal{B}$ of sets are said to be cross-intersecting if each set in $\mathcal{A}$ intersects each set in $\mathcal{B}$. For any two integers $n$ and $k$ with $1 \leq k \leq n$, let ${[n] \choose \leq k}$ denote the family of subsets of $\{1, \dots, n\}$ of size at most $k$, and let $\mathcal{S}_{n,k}$ denote the family of sets in ${[n] \choose \leq k}$ that contain $1$. The author recently showed that if $\mathcal{A} \subseteq {[m] \choose \leq r}$, $\mathcal{B} \subseteq {[n] \choose \leq s}$, and $\mathcal{A}$ and $\mathcal{B}$ are cross-intersecting, then $|\mathcal{A}||\mathcal{B}| \leq \mathcal{S}_{m,r}||\mathcal{S}_{n,s}|$. We prove a version of this result for the more general setting of \emph{weighted} sets. We show that if $g : {[m] \choose \leq r} \rightarrow \mathbb{R}^+$ and $h : {[n] \choose \leq s} \rightarrow \mathbb{R}^+$ are functions that obey certain conditions, $\mathcal{A} \subseteq {[m] \choose \leq r}$, $\mathcal{B} \subseteq {[n] \choose \leq s}$, and $\mathcal{A}$ and $\mathcal{B}$ are cross-intersecting, then $$\sum_{A \in \mathcal{A}} g(A) \sum_{B \in \mathcal{B}} h(B) \leq \sum_{C \in \mathcal{S}_{m,r}} g(C) \sum_{D \in \mathcal{S}_{n,s}} h(D).$$The bound is attained by taking $\mathcal{A} = \mathcal{S}_{m,r}$ and $\mathcal{B} = \mathcal{S}_{n,s}$. We also show that this result yields new sharp bounds for the product of sizes of cross-intersecting families of integer sequences and of cross-intersecting families of multisets.


Mathematics ◽  
2018 ◽  
Vol 6 (12) ◽  
pp. 281
Author(s):  
Erhan Güler

We consider a family of higher degree Enneper minimal surface E m for positive integers m in the three-dimensional Euclidean space E 3 . We compute algebraic equation, degree and integral free representation of Enneper minimal surface for m = 1 , 2 , 3 . Finally, we give some results and relations for the family E m .


1970 ◽  
Vol 7 (02) ◽  
pp. 505-507 ◽  
Author(s):  
Gedalia Ailam ◽  
Mahabanoo N. Tata

Let {an } be an increasing sequence of positive integers and let be the family of all functions from the positive integers into the positive integers, which satisfy Assume that are random functions with probabilities and for all n &gt; 1 and 0 elsewhere, i.e., all permissible values of f, given the past, are equally likely.


Sign in / Sign up

Export Citation Format

Share Document