Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Satyan L. Devadoss"'
Autor:
Satyan L. Devadoss, Matthew Harvey
Publikováno v:
Computational Geometry. 111:101977
Over a decade ago, it was shown that every edge unfolding of the Platonic solids was without self-overlap, yielding a valid net. We consider this property for regular polytopes in arbitrary dimensions, notably the simplex, cube, and orthoplex. It was
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8bfabb92f3ad0d443c285431381a72f9
https://doi.org/10.1016/j.comgeo.2022.101977
https://doi.org/10.1016/j.comgeo.2022.101977
Autor:
Owen Schuh, Satyan L. Devadoss
Publikováno v:
Leonardo. 52:279-283
How can vibrant, contemporary art be produced that deals with vibrant, contemporary mathematics? To address this question, a collaboration began between an artist (Schuh) and a mathematician (Devadoss), revolving around recent problems in phylogeneti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2bb2c986d2413d4d480bc9aa0833bd1f
https://doi.org/10.1162/leon_a_01475
https://doi.org/10.1162/leon_a_01475
Publikováno v:
Math Horizons. 26:10-13
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::37cd7fcf5d1176f531610ffc4bc8d446
https://doi.org/10.1080/10724117.2019.1568093
https://doi.org/10.1080/10724117.2019.1568093
Autor:
Satyan L. Devadoss
Publikováno v:
Notices of the American Mathematical Society. 69:1
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::24f9e32b0953d4e9ba2d3bd0f87cebdd
https://doi.org/10.1090/noti2495
https://doi.org/10.1090/noti2495
We show that every ridge unfolding of an $n$-cube is without self-overlap, yielding a valid net. The results are obtained by developing machinery that translates cube unfolding into combinatorial frameworks. Moreover, the geometry of the bounding box
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c32043558150067fdd7b93509582ba2d
Publikováno v:
Associahedra, Tamari Lattices and Related Structures ISBN: 9783034804042
The Tamari lattice and the associahedron provide methods of measuring associativity on a line. The real moduli space of marked curves captures the space of such associativity. We consider a natural generalization by considering the moduli space of ma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c920992a11cf10243389b1bc35b2ef93
https://ora.ox.ac.uk/objects/uuid:2d6cb893-28ca-4b69-8c50-de2af677d1be
https://ora.ox.ac.uk/objects/uuid:2d6cb893-28ca-4b69-8c50-de2af677d1be
Autor:
Satyan L. Devadoss, Jack Morava
Publikováno v:
Advances in Applied Mathematics. 67:75-95
The orientable cover of the moduli space of real genus zero algebraic curves with marked points is a compact aspherical manifold tiled by associahedra, which resolves the singularities of the space of phylogenetic trees. The resolution maps planar me
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::40b756507958eb1e53a0ea4d9559346a
https://doi.org/10.1016/j.aam.2015.03.006
https://doi.org/10.1016/j.aam.2015.03.006
Publikováno v:
Discrete Applied Mathematics. 170:46-54
The straight skeleton construction creates a straight-line tree from a polygon. Motivated by moduli spaces from algebraic geometry, we consider the inverse problem of constructing a polygon whose straight skeleton is a given tree. We prove there exis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c7c4dda73bb239af87af59388787f941
https://doi.org/10.1016/j.dam.2014.01.013
https://doi.org/10.1016/j.dam.2014.01.013
Autor:
Satyan L. Devadoss, Samantha Petti
A classic problem in computational biology is constructing a phylogenetic tree given a set of distances between n species. In most cases, a tree structure is too constraining. We consider a circular split network, a generalization of a tree in which
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::70f33ebdd508dee4cae28430f73739ac
Publikováno v:
Journal of Combinatorial Theory, Series A. 118(7):2035-2055
Given a simple graph G, the graph associahedron KG is a simple polytope whose face poset is based on the connected subgraphs of G. This paper defines and constructs graph associahedra in a general context, for pseudographs with loops and multiple edg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::64078280ae855bc80d8f2367ace6882e