Lianna Hambardzumyan

activity

20152026

most citedFactorization norms and an inverse theorem for MaxCut

1 citations · 2 across the 10 of their papers we have counts for

collaborators

Showing cs.DMShow all

3 papers · 1 filter

cs.DM2020

Chang's lemma via Pinsker's inequality

Lianna Hambardzumyan, Yaqiao Li

Extending the idea in [Impagliazzo, R., Moore, C. and Russell, A., An entropic proof of Chang's inequality. SIAM Journal on Discrete Mathematics, 28(1), pp.173-176.] we give a shor…

cs.DM2019

Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions

Yuval Filmus, Lianna Hambardzumyan, Hamed Hatami +2

The seminal result of Kahn, Kalai and Linial shows that a coalition of $O (\frac{n}{l o g n})$ players can bias the outcome of any Boolean function ${0, 1}^{n} \to {0, 1}$ with respe…

cs.DM2015

Graphs, Disjoint Matchings and Some Inequalities

Lianna Hambardzumyan, Vahan Mkrtchyan

For $k \geq 1$ and a graph $G$ let $ν_{k} (G)$ denote the size of a maximum $k$ -edge-colorable subgraph of $G$ . Mkrtchyan, Petrosyan and Vardanyan proved that $ν_2(G)\geq \frac45\cdot…