Reputation
280
Top tag
Next privilege 500 Rep.
Access review queues
Badges
2 10
Newest
 Caucus
Impact
~3k people reached

  • 0 posts edited
  • 2 helpful flags
  • 80 votes cast
Jan
14
comment (n,k)-universal set
Off Topic: Does the general (n,k) universal set for non-boolean values has a name? I hardly can find anything on (n,k) universal set when every element can take more than two values.
Jan
2
asked number of strings with hamming distance exactly $d$
Jan
1
comment how far $2k+log_2(k+1)$ is to $k+log_2(k)$
@Ian Thanks. I am making my way into the notations and know Big theta means bounded from above and below. $f'(x)$ is the best function could possibly exist. I would think ratio isn't applicable here. Please turn your comment to an answer.
Jan
1
asked how far $2k+log_2(k+1)$ is to $k+log_2(k)$
Dec
15
asked strict partial orders that guarantee monotonic orientation functions
Nov
30
revised definition of projection operation for boolean functions
deleted 25 characters in body
Nov
30
revised definition of projection operation for boolean functions
deleted 25 characters in body
Nov
30
comment definition of projection operation for boolean functions
Sorry for the confusion; I'm not familiar with the right terms. I have a set of boolean functions where every function represents a subset of A. For example one function $f_1=\{a\}$ another $f_2=\{a,b\}$ another $f_3=\{\emptyset\}$ for $A=\{a,b\}$.
Nov
30
revised definition of projection operation for boolean functions
edited body
Nov
30
comment definition of projection operation for boolean functions
@MarioCarneiro true. I have subsets of the power set of A . Usually denotes by 1 if $a\in f$. will edit the question accordingly.
Nov
30
asked definition of projection operation for boolean functions
Nov
29
comment is $O(3^k)$ polynomial for $k\in o(n)$?
Thanks. In general though, $O(3^k)$ will remain polynomial as long as $k$ is a polynomial in $n$, correct?
Nov
29
asked is $O(3^k)$ polynomial for $k\in o(n)$?
Oct
28
comment lower bound on $\sum_{i=0}^{k}\binom{n}{i}$ for $k<n$
Interesting. I assume $k\leq n/2$ for which the upper bound $\sum_{i=0}^{k}\binom{n}{i}\leq 2^{nH(k/n)}$ exists. Not sure if this is different from what you are saying.
Oct
26
revised lower bound on $\sum_{i=0}^{k}\binom{n}{i}$ for $k<n$
edited title
Oct
26
revised lower bound on $\sum_{i=0}^{k}\binom{n}{i}$ for $k<n$
edited title
Oct
26
asked lower bound on $\sum_{i=0}^{k}\binom{n}{i}$ for $k<n$
Oct
20
asked lower bounds on the number of directed acyclic graphs with $n$ vertices
Oct
5
comment directed trees versus singly-connected directed graphs
@BrianM.Scott Thanks. I expected to see you answering this :) . Is there a difference between directed-trees and oriented trees (Polytrees) then ? ( I have a paper where authors distinguish between the two without defining them)
Oct
5
asked directed trees versus singly-connected directed graphs