Zobrazeno 1 - 10
of 447
pro vyhledávání: '"Hubard, A."'
Autor:
Hubard, Alfredo, Soberón, Pablo
We prove a common generalization to several mass partition results using hyperplane arrangements to split $\mathbb{R}^d$ into two sets. Our main result implies the ham-sandwich theorem, the necklace splitting theorem for two thieves, a theorem about
Externí odkaz:
http://arxiv.org/abs/2404.14320
Autor:
Hubard, Alfredo, Parlier, Hugo
We show a generalization of the crossing lemma for multi-graphs drawn on orientable surfaces in which pairs of edges are assumed to be drawn by non-homotopic simple arcs which pairwise cross at most $k$ times.
Comment: 7 pages
Comment: 7 pages
Externí odkaz:
http://arxiv.org/abs/2403.15261
Voltage operations extend traditional geometric and combinatorial operations (such as medial, truncation, prism, and pyramid over a polytope) to operations on maniplexes, maps, polytopes, and hypertopes. In classical operations, the symmetries of the
Externí odkaz:
http://arxiv.org/abs/2312.13184
We prove that for any Borel probability measure $\mu$ on $\mathbb R^n$ there exists a set $X\subset \mathbb R^n$ of $n+1$ points such that any $n$-variate quadratic polynomial $P$ that is nonnegative on $X$ (i.e. $P(x)\geq 0$, for every $x \in X$) sa
Externí odkaz:
http://arxiv.org/abs/2308.14060
The degenerate crossing number of a graph is the minimum number of transverse crossings among all its drawings, where edges are represented as simple arcs and multiple edges passing through the same point are counted as a single crossing. Interpretin
Externí odkaz:
http://arxiv.org/abs/2308.10666
Autor:
Hubard, Isabel, Toledo, Micael
In 1999 Michael Hartley showed that any abstract polytope can be constructed as a double coset poset, by means of a C-group $\C$ and a subgroup $N \leq \C$. Subgroups $N \leq \C$ that give rise to abstract polytopes through such construction are call
Externí odkaz:
http://arxiv.org/abs/2308.09054
Autor:
Hubard, Alfredo, Suk, Andrew
Given a complete simple topological graph $G$, a $k$-face generated by $G$ is the open bounded region enclosed by the edges of a non-self-intersecting $k$-cycle in $G$. Interestingly, there are complete simple topological graphs with the property tha
Externí odkaz:
http://arxiv.org/abs/2212.01311
Autor:
Gabriela García Hubard
Publikováno v:
Lectora: Revista de Dones i Textualitat, Iss 30 (2024)
Enfatizando las complejas interrelaciones disciplinares que se han ido tejiendo históricamente en torno al placer femenino, este texto ofrece un recorrido por algunos de los momentos clave de las mutilaciones físicas, psíquicas y textuales del cl
Externí odkaz:
https://doaj.org/article/078489dab2144d6faff003fed968e775
All polytopes are coset geometries: characterizing automorphism groups of k-orbit abstract polytopes
Autor:
Hubard, Isabel, Mochán, Elías
Abstract polytopes generalize the classical notion of convex polytopes to more general combinatorial structures. The most studied ones are regular and chiral polytopes, as it is well-known, they can be constructed as coset geometries from their autom
Externí odkaz:
http://arxiv.org/abs/2208.00547
In this article, we investigate short topological decompositions of non-orientable surfaces and provide algorithms to compute them. Our main result is a polynomial-time algorithm that for any graph embedded in a non-orientable surface computes a cano
Externí odkaz:
http://arxiv.org/abs/2203.06659