442 reputation
213
bio website talegari.wikidot.com
location
age
visits member for 2 years, 4 months
seen 9 hours ago

gmail address: sri.teach


11h
comment How to calculate the number of integer solution of a linear equation with constraints?
See lemma 2 here
2d
comment Combination with restriction
I found that the bound is achieved if the steiner system $(n,m,l)$ exists. I have deleted my comment and posted it as an answer.
2d
answered Combination with restriction
Jul
21
comment maximum size of a $k$-intersecting family of $[n]$
Thanks for your answer. I could not have asked for more.
Jul
19
awarded  Benefactor
Jul
19
accepted maximum size of a $k$-intersecting family of $[n]$
Jul
18
comment maximum size of a $k$-intersecting family of $[n]$
+1 Thanks for your answer. Most of the problems discusses in the paper seem to concern the family of subsets from $\binom{[n]}{k}$ and not the set of all subsets.
Jul
16
comment How many squares can be formed from n equidistant points in a circle?
did you mean, uniformly spaced on the circumference?
Jul
16
comment How many squares can be formed from n equidistant points in a circle?
I reckon, for $n=6$, we do not get any squares. Please do clarify by writing a picture. Square is formable iff $4|n$ and $n\ge 4$. Further, there are $\frac{n-4}{4}+1$ distinct squares.
Jul
16
revised Tough combinatorics problem
added 75 characters in body
Jul
16
answered Tough combinatorics problem
Jul
15
comment The rows continue to be different to each other
Thanks for the nice answer. Would it be better to start with s1 instead of $s_0$ (since $s_0$ has no meaning as such)? If all elements in the first column are equal, then we can delete that column. So we assume that there are at least two distinct elements in the first column and hence $s_1=2$
Jul
15
awarded  Promoter
Jul
15
comment Tough combinatorics problem
Would you specify what 'match exactly $k$ of them with letters from our string' mean? Suppose we have $a+b+c=j$ where $a$ things of type $A$, $b$ things of type $B$ and $c$ things of type $C$. Then, is $k=a\cdot s_a+b\cdot s_b+c\cdot s_c$ ?
Jul
5
answered Let $k \le \frac{n}{2}$, and suppose that $F$ is an antichain in $P(n)$ such that every $A \in F$ has $|A| \le k$. Prove that $|F| \le \binom{n}{k}$
Jul
2
comment Number of queries required to find the function.
The number of buttons is not less then the number of bulbs. Consider the particular case when every button is connected one particular bulb. I believe, we would require 2010 moves to figure this out (which is like the worst case scenario -- loosely speaking).
Jul
2
revised resilience of graphs question
added line to define 'monotone' property
Jul
2
suggested suggested edit on resilience of graphs question
Jul
2
comment Number of queries required to find the function.
Please clarify -- Does a button connect to exactly one bulb or can it possibly connect to multiple bulbs?
Jul
2
comment Counting of the elements in a set
Thanks, I have edited from $\binom{n-1}{nG-2}$ to $\binom{n-1}{nG-1}$.