Zobrazeno 1 - 10
of 83
pro vyhledávání: '"Rabinovich, Yuri"'
Autor:
Newman, Ilan, Rabinovich, Yuri
We study deterministic online embeddings of metrics spaces into normed spaces and into trees against an adaptive adversary. Main results include a polynomial lower bound on the (multiplicative) distortion of embedding into Euclidean spaces, a tight e
Externí odkaz:
http://arxiv.org/abs/2303.15945
We show that the size of the largest simple d-cycle in a simplicial d-complex $K$ is at least a square root of $K$'s density. This generalizes a well-known classical result of Erd\H{o}s and Gallai \cite{EG59} for graphs. We use methods from matroid t
Externí odkaz:
http://arxiv.org/abs/1910.04605
We introduce and study a $d$-dimensional generalization of Hamiltonian cycles in graphs - the Hamiltonian $d$-cycles in $K_n^d$ (the complete simplicial $d$-complex over a vertex set of size $n$). Those are the simple $d$-cycles of a complete rank, o
Externí odkaz:
http://arxiv.org/abs/1907.07907
Autor:
Pinchasi, Rom, Rabinovich, Yuri
Let P be a polygon with rational vertices in the plane. We show that for any finite odd-sized collection of translates of P, the area of the set of points lying in an odd number of these translates is bounded away from 0 by a constant depending on P
Externí odkaz:
http://arxiv.org/abs/1701.00700
Publikováno v:
In Journal of Combinatorial Theory, Series B September 2021 150:119-143
A $d$-hypertree on $[n]$ is a maximal acyclic $d$-dimensional simplicial complex with full $(d-1)$-skeleton on the vertex set $[n]$. Alternatively, in the language of algebraic topology, it is a minimal $d$-dimensional simplicial complex $T$ (assumin
Externí odkaz:
http://arxiv.org/abs/1507.04471
Autor:
Newman, Ilan I., Rabinovich, Yuri
The paper studies the connectivity properties of facet graphs of simplicial complexes of combinatorial interest. In particular, it is shown that the facet graphs of $d$-cycles, $d$-hypertrees and $d$-hypercuts are, respectively, $(d+1)$, $d$, and $(n
Externí odkaz:
http://arxiv.org/abs/1502.02232
Let $F$ be an $n$-vertex forest. We say that an edge $e\notin F$ is in the shadow of $F$ if $F\cup\{e\}$ contains a cycle. It is easy to see that if $F$ is "almost a tree", that is, it has $n-2$ edges, then at least $\lfloor\frac{n^2}{4}\rfloor$ edge
Externí odkaz:
http://arxiv.org/abs/1408.0602
In binary jumbled pattern matching we wish to preprocess a binary string $S$ in order to answer queries $(i,j)$ which ask for a substring of $S$ that is of size $i$ and has exactly $j$ 1-bits. The problem naturally generalizes to node-labeled trees a
Externí odkaz:
http://arxiv.org/abs/1401.2065
Publikováno v:
Discrete & Computational Geometry 47 (2012), 187-214
In this paper, we present a simple factor 6 algorithm for approximating the optimal multiplicative distortion of embedding a graph metric into a tree metric (thus improving and simplifying the factor 100 and 27 algorithms of B\v{a}doiu, Indyk, and Si
Externí odkaz:
http://arxiv.org/abs/1007.0489