scholarly journals Minimal Weight in Union-Closed Families

10.37236/582 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Victor Falgas-Ravry

Let $\Omega$ be a finite set and let $\mathcal{S} \subseteq \mathcal{P}(\Omega)$ be a set system on $\Omega$. For $x\in \Omega$, we denote by $d_{\mathcal{S}}(x)$ the number of members of $\mathcal{S}$ containing $x$. A long-standing conjecture of Frankl states that if $\mathcal{S}$ is union-closed then there is some $x\in \Omega$ with $d_{\mathcal{S}}(x)\geq \frac{1}{2}|\mathcal{S}|$. We consider a related question. Define the weight of a family $\mathcal{S}$ to be $w(\mathcal{S}) := \sum_{A \in \mathcal{S}} |A|$. Suppose $\mathcal{S}$ is union-closed. How small can $w(\mathcal{S})$ be? Reimer showed $$w(\mathcal{S}) \geq \frac{1}{2} |\mathcal{S}| \log_2 |\mathcal{S}|,$$ and that this inequality is tight. In this paper we show how Reimer's bound may be improved if we have some additional information about the domain $\Omega$ of $\mathcal{S}$: if $\mathcal{S}$ separates the points of its domain, then $$w(\mathcal{S})\geq \binom{|\Omega|}{2}.$$ This is stronger than Reimer's Theorem when $\vert \Omega \vert > \sqrt{|\mathcal{S}|\log_2 |\mathcal{S}|}$. In addition we construct a family of examples showing the combined bound on $w(\mathcal{S})$ is tight except in the region $|\Omega|=\Theta (\sqrt{|\mathcal{S}|\log_2 |\mathcal{S}|})$, where it may be off by a multiplicative factor of $2$. Our proof also gives a lower bound on the average degree: if $\mathcal{S}$ is a point-separating union-closed family on $\Omega$, then $$ \frac{1}{|\Omega|} \sum_{x \in \Omega} d_{\mathcal{S}}(x) \geq \frac{1}{2} \sqrt{|\mathcal{S}| \log_2 |\mathcal{S}|}+ O(1),$$ and this is best possible except for a multiplicative factor of $2$.

2019 ◽  
Vol 16 (04) ◽  
pp. 823-839
Author(s):  
Abhishek T Bharadwaj

Recently, Gun, Saha and Sinha had introduced the notion of generalised Euler–Briggs constant [Formula: see text] for a finite set of primes [Formula: see text]. In a subsequent work, Gun, Murty and Saha introduced the following [Formula: see text]-vector space [Formula: see text] and showed that [Formula: see text] In this note, we improve the lower bound, namely [Formula: see text]


2020 ◽  
Vol 39 (5) ◽  
pp. 6217-6230
Author(s):  
Inmaculada Gutiérrez ◽  
Daniel Gómez ◽  
Javier Castro ◽  
Rosa Espínola

In this work we introduce the notion of the weighted graph associated with a fuzzy measure. Having a finite set of elements between which there exists an affinity fuzzy relation, we propose the definition of a group based on that affinity fuzzy relation between the individuals. Then, we propose an algorithm based on the Louvain’s method to deal with community detection problems with additional information independent of the graph. We also provide a particular method to solve community detection problems over extended fuzzy graphs. Finally, we test the performance of our proposal by means of some detailed computational tests calculated in several benchmark models.


2013 ◽  
Vol 11 (10) ◽  
Author(s):  
Vajk Szécsi

AbstractA nearly sharp lower bound on the length of the longest trail in a graph on n vertices and average degree k is given provided the graph is dense enough (k ≥ 12.5).


10.37236/6405 ◽  
2018 ◽  
Vol 25 (1) ◽  
Author(s):  
Landon Rabern

We improve the best known bounds on average degree of online $k$-list-critical graphs for $k \geqslant 6$. Specifically, for $k \geqslant 7$ we show that every non-complete online $k$-list-critical graph has average degree at least $k-1 + \frac{(k-3)^2 (2 k-3)}{k^4-2 k^3-11 k^2+28 k-14}$ and every non-complete online $6$-list-critical graph has average degree at least $5 + \frac{93}{766}$. The same bounds hold for offline $k$-list-critical graphs.


2000 ◽  
Vol 32 (01) ◽  
pp. 244-255 ◽  
Author(s):  
V. Dumas ◽  
A. Simonian

We consider a fluid queue fed by a superposition of a finite number of On/Off sources, the distribution of the On period being subexponential for some of them and exponential for the others. We provide general lower and upper bounds for the tail of the stationary buffer content distribution in terms of the so-called minimal subsets of sources. We then show that this tail decays at exponential or subexponential speed according as a certain parameter is smaller or larger than the ouput rate. If we replace the subexponential tails by regularly varying tails, the upper bound and the lower bound are sharp in that they differ only by a multiplicative factor.


1998 ◽  
Vol 48 (1-2) ◽  
pp. 61-72
Author(s):  
Joydeep Bhanja

In this paper we consider an example where for each i, i = 1,2, ... , n, the observations Xij , j = 1, 2, ... , k are i.i.d . Binomial ( ni, θ). Based on a theory developed by us earlier, we propose estimates of θ which are asymptotically efficient under the assumption that k ≥ 2, the ni 's come from a finite set { 1, 2, ... , q} and some mild regularity conditions on the sequence { ni} and θ hold. We present the results of a simulation whlch indicate, among other thlngs, the asymptotic lower bound to variance is lower than or approximately equal to simulated Variances and a simple moment estimate of θ does as well as the asymptotically efficient estimates.


2009 ◽  
Vol 18 (1-2) ◽  
pp. 3-15 ◽  
Author(s):  
NOGA ALON

We describe a lower bound for the rank of any real matrix in which all diagonal entries are significantly larger in absolute value than all other entries, and discuss several applications of this result to the study of problems in Geometry, Coding Theory, Extremal Finite Set Theory and Probability. This is partly a survey, containing a unified approach for proving various known results, but it contains several new results as well.


10.37236/5971 ◽  
2016 ◽  
Vol 23 (3) ◽  
Author(s):  
Landon Rabern

This short note proves that every non-complete $k$-list-critical graph has average degree at least $k-1 + \frac{k-3}{k^2-2k+2}$. This improves the best known bound for $k = 4,5,6$. The same bound holds for online $k$-list-critical graphs.


2015 ◽  
Author(s):  
Abhinav Ganesan ◽  
Sidharth Jaggi ◽  
Venkatesh Saligrama

This paper deals with an abstraction of a unified problem of drug discovery and pathogen identification. Here, the ``lead compounds'' are abstracted as inhibitors, pathogenic proteins as defectives, and the mixture of ``ineffective'' chemical compounds and non-pathogenic proteins as normal items. A defective could be immune to the presence of an inhibitor in a test. So, a test containing a defective is positive iff it does not contain its ``associated'' inhibitor. The goal of this paper is to identify the defectives, inhibitors, and their ``associations'' with high probability, or in other words, learn the Immune Defectives Graph (IDG). We propose a probabilistic non-adaptive pooling design, a probabilistic two-stage adaptive pooling design and decoding algorithms for learning the IDG. For the two-stage adaptive-pooling design, we show that the sample complexity of the number of tests required to guarantee recovery of the inhibitors, defectives and their associations with high probability, i.e., the upper bound, exceeds the proposed lower bound by a logarithmic multiplicative factor in the number of items. For the non-adaptive pooling design, in the large inhibitor regime, we show that the upper bound exceeds the proposed lower bound by a logarithmic multiplicative factor in the number of inhibitors.


10.37236/6 ◽  
2012 ◽  
Vol 19 (1) ◽  
Author(s):  
Andrew Lazowski ◽  
Stephen M. Shea

A labeling of a graph is a function from the vertices of the graph to some finite set.  In 1996, Albertson and Collins defined distinguishing labelings of undirected graphs.  Their definition easily extends to directed graphs.  Let $G$ be a directed graph associated to the $k$-block presentation of a Bernoulli scheme $X$.  We determine the automorphism group of $G$, and thus the distinguishing labelings of $G$.  A labeling of $G$ defines a finite factor of $X$.  We define demarcating labelings and prove that demarcating labelings define finitarily Markovian finite factors of $X$.  We use the Bell numbers to find a lower bound for the number of finitarily Markovian finite factors of a Bernoulli scheme.  We show that demarcating labelings of $G$ are distinguishing.


Sign in / Sign up

Export Citation Format

Share Document