Zobrazeno 1 - 10
of 57
pro vyhledávání: '"Eran Nevo"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings, 28th... (2020)
this is an extended abstract of the full version. We study n-vertex d-dimensional polytopes with at most one nonsimplex facet with, say, d + s vertices, called almost simplicial polytopes. We provide tight lower and upper bounds for the face numbers
Externí odkaz:
https://doaj.org/article/709cd6da43534789b606b52c2dd09dbd
Autor:
Satoshi Murai, Eran Nevo
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AS,..., Iss Proceedings (2013)
The notion of $r$-stackedness for simplicial polytopes was introduced by McMullen and Walkup in 1971 as a generalization of stacked polytopes. In this paper, we define the $r$-stackedness for triangulated homology manifolds and study their basic prop
Externí odkaz:
https://doaj.org/article/aea19be59d37495499db911b31e72563
We consider the Erd\H{o}s-R\'enyi evolution of random graphs, where a new uniformly distributed edge is added to the graph in every step. For every fixed $d\ge 1$, we show that with high probability, the graph becomes rigid in $\mathbb R^d$ at the ve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d82495b2836267d117677d3d579d6115
http://arxiv.org/abs/2202.09917
http://arxiv.org/abs/2202.09917
Publikováno v:
Scopus-Elsevier
We study $n$-vertex $d$-dimensional polytopes with at most one nonsimplex facet with, say, $d+s$ vertices, called almost simplicial polytopes. We provide tight lower and upper bound theorems for these polytopes as functions of $d,n$, and $s$, thus ge
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c2b7da61aacb9f6379cc7211be67bd62
https://doi.org/10.4153/s0008414x18000123
https://doi.org/10.4153/s0008414x18000123
Publikováno v:
Algebraic Combinatorics. 2:367-378
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4dd873fde815ae1a6a67be4a9c200275
https://doi.org/10.5802/alco.30
https://doi.org/10.5802/alco.30
Autor:
Eran Nevo
We obtain computational hardness results for f-vectors of polytopes by exhibiting reductions of the problems DIVISOR and SEMI-PRIME TESTABILITY to problems on f-vectors of polytopes. Further, we show that the corresponding problems for f-vectors of s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cc658dddeeedf97805673f3ff877087a
The goal of this article is to compare the coefficients in the expansion of the permanent with those in the expansion of the determinant of a three-lines circulant matrix. As an application we solve a conjecture stated in [17] concerning the minimali
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::38cfe8eb0ff5cbf77af3f43193d31323
http://hdl.handle.net/11390/1182995
http://hdl.handle.net/11390/1182995
Publikováno v:
Discrete & Computational Geometry. 60:420-429
Let $$U_1,\ldots ,U_{d+1}$$ be n-element sets in $$\mathbb {R}^d$$ . Pach’s selection theorem says that there exist subsets $$Z_1\subset U_1,\ldots ,Z_{d+1}\subset U_{d+1}$$ and a point $$u \in \mathbb {R}^d$$ such that each $$|Z_i|\ge c_1(d)n$$ an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ed3c40c1a55c1032b8e50d879ed1d9e2
https://doi.org/10.1007/s00454-018-9998-8
https://doi.org/10.1007/s00454-018-9998-8
Autor:
Abed Abedelfatah, Eran Nevo
Publikováno v:
Journal of Algebraic Combinatorics. 46:287-295
We consider two problems regarding vanishing patterns in the Betti table of edge ideals $I$ in polynomial algebra $S$. First, we show that the $j$-strand is connected if $j=3$ (for $j=2$ this is easy and known), and give examples where the $j$-strand
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f540cce292250cb07430fe409c030a00
https://doi.org/10.1007/s10801-017-0747-5
https://doi.org/10.1007/s10801-017-0747-5
Autor:
Eran Nevo
We consider geometric and computational measures of complexity for sets of integer vectors, asking for a qualitative difference between $f$-vectors of simplicial and general $d$-polytopes, as well as flag $f$-vectors of $d$-polytopes and regular CW $
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6f246c624a44912aac023d18841cec0a
http://arxiv.org/abs/1908.09628
http://arxiv.org/abs/1908.09628