Reputation
854
Top tag
Next privilege 1,000 Rep.
Create new tags
Badges
4 9
Newest
 Yearling
Impact
~8k people reached

  • 0 posts edited
  • 2 helpful flags
  • 135 votes cast
Apr
22
answered On the invertibility of adjacency matrix
Feb
25
awarded  Yearling
Feb
25
answered Hash functions for unordered data
Feb
23
comment Hash functions for unordered data
You may want to look into count-min sketches (essentially, the multi-set version of Bloom filters).
Feb
18
answered When a set of consecutive numbers can be covered by differences between distinct integers?
Dec
19
awarded  Caucus
Nov
10
answered Open mathematical questions for which we really, really have no idea what the answer is
Nov
6
answered Avoiding the Integration Constant
Oct
17
comment How many players needed for the game to have the highest probability of finishing the fastest?
What happens when a player is marked with multiple colors at once? What happens when $A\rightarrow C\wedge B\rightarrow C$?
Oct
17
comment How many players needed for the game to have the highest probability of finishing the fastest?
What about $A \rightarrow C \wedge B \rightarrow C$? And what actually is the result of $A \rightarrow B \wedge B \rightarrow A$?
Oct
8
answered Algorithm to answer questions on dominated input
Aug
29
comment How fat is a triangle?
Is there ever a case where the largest contained square does not rest on one side of the triangle?
Jul
30
awarded  Yearling
Jun
17
answered Confused with the definition of NP
Apr
5
comment Mapping a set of sets to a partitioning.
Is it clear that you've "partitioned $U$ into $2^n$ distinct sets"? What if your sets are such that there exist two elements $e_1$ and $e_2$ such that $e_1 \in S_i \iff e_2 \in S_i$ for all $i$?
Apr
2
answered Understanding the partition function
Apr
2
comment Understanding the partition function
I believe that $P(0)$ is taken to be equal to 1 by convention.
Apr
2
awarded  Citizen Patrol
Mar
3
comment Non-monotone evasive graph properties.
I'm not sure I understand your objection. $P_k$ is not defined as the set of all graphs containing $k$ edges; it is the subset of $P$ consisting of graphs containing $k$ edges.
Feb
28
comment Non-monotone evasive graph properties.
Please see my edited answer for a further generalization of this principle.