Reputation
2,260
Top tag
Next privilege 2,500 Rep.
Create tag synonyms
Badges
12 29
Impact
~55k people reached

Sep
1
comment Finding a function satisfying a certain inequality
@AlexRavsky The admissible values are indeed non-negative. I've also changed the question giving a relaxed condition on $f(n,0).$
Sep
1
revised Finding a function satisfying a certain inequality
added 76 characters in body
Aug
31
revised Finding a function satisfying a certain inequality
deleted 5 characters in body
Aug
31
revised Finding a function satisfying a certain inequality
deleted 152 characters in body
Aug
29
asked Finding a function satisfying a certain inequality
Aug
24
revised Finding a function such that $(n-2)/2 + f(n-1) \leq f(n)$
added 26 characters in body
Aug
24
comment Finding a function such that $(n-2)/2 + f(n-1) \leq f(n)$
@abiessu Yes that's what I mean. I'll correct the question. Though if I understand your last comment it is fact not possible to obtain such f?
Aug
24
asked Finding a function such that $(n-2)/2 + f(n-1) \leq f(n)$
Aug
17
accepted Concentration property of entropy
Aug
17
asked Concentration property of entropy
Aug
10
revised A matrix with a dense submatrix - application of Chernoff’s Inequality
added 4 characters in body
Jul
31
awarded  graph-theory
Jul
19
comment Graph Theory:Folkman Graph
A good start would be to give a definition/construction of Folkman's graph that will allow to describe its automorphism group. Unless you are happy with a proof involving Sage math :)
Jul
15
accepted A construction of a Hadamard matrix
Jul
13
comment A construction of a Hadamard matrix
@darijgrinberg Thank you - that helped. I'd be glad to accept this as an answer in case you want to copy paste the comments as an answer.
Jul
13
asked A construction of a Hadamard matrix
Jul
12
asked A matrix with a dense submatrix - application of Chernoff’s Inequality
Jul
12
answered Graph Theory : Strongly regular graph
Jul
12
revised Graph Theory : Strongly regular graph
added 7 characters in body
Jun
19
comment Graphs with 12 edges over the vertices $\{1,2,…,12\}$ have two vertices with a degree of 5
First of all, are you counting up to isomorphism of graphs or are the graphs labelled?