Classifying Simplicial Dissections of Convex Polyhedra with Symmetry
Ontology highlight
ABSTRACT:
SUBMITTER: Bigatti A
PROVIDER: S-EPMC7340891 | biostudies-literature | 2020 Jun
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:Polyhedra are ubiquitous in chemistry, biology, mathematics and other disciplines. Coordination-driven self-assembly has created molecules mimicking Platonic, Archimedean and even Goldberg polyhedra, however, nesting multiple polyhedra in one cluster is challenging, not only for synthesis but also for determining the alignment of the polyhedra. Here, we synthesize a nested Ag90 nanocluster under solvothermal condition. This pseudo-Th symmetric Ag90 ball contains three concentric Ag polyhedra with apparently incompatible symmetry. Specifically, the inner (Ag6) and middle (Ag24) shells are octahedral (Oh), an octahedron (a Platonic solid with six 3.3.3.3 vertices) and a truncated octahedron (an Archimedean solid with twenty-four 4.6.6 vertices), whereas the outer (Ag60) shell is icosahedral (Ih), a rhombicosidodecahedron (an Archimedean solid with sixty 3.4.5.4 vertices). The Ag90 nanocluster solves the apparent incompatibility with the most symmetric arrangement of 2- and 3-fold rotational axes, similar to the arrangement in the model called Kepler's Kosmos, devised by the mathematician John Conway.
| S-EPMC7335041 | biostudies-literature
Project description:The three known classes of convex polyhedron with equal edge lengths and polyhedral symmetry--tetrahedral, octahedral, and icosahedral--are the 5 Platonic polyhedra, the 13 Archimedean polyhedra--including the truncated icosahedron or soccer ball--and the 2 rhombic polyhedra reported by Johannes Kepler in 1611. (Some carbon fullerenes, inorganic cages, icosahedral viruses, geodesic structures, and protein complexes resemble these fundamental shapes.) Here we add a fourth class, "Goldberg polyhedra," which are also convex and equilateral. We begin by decorating each of the triangular facets of a tetrahedron, an octahedron, or an icosahedron with the T vertices and connecting edges of a "Goldberg triangle." We obtain the unique set of internal angles in each planar face of each polyhedron by solving a system of n equations and n variables, where the equations set the dihedral angle discrepancy about different types of edge to zero, and the variables are a subset of the internal angles in 6gons. Like the faces in Kepler's rhombic polyhedra, the 6gon faces in Goldberg polyhedra are equilateral and planar but not equiangular. We show that there is just a single tetrahedral Goldberg polyhedron, a single octahedral one, and a systematic, countable infinity of icosahedral ones, one for each Goldberg triangle. Unlike carbon fullerenes and faceted viruses, the icosahedral Goldberg polyhedra are nearly spherical. The reasoning and techniques presented here will enable discovery of still more classes of convex equilateral polyhedra with polyhedral symmetry.
| S-EPMC3939887 | biostudies-other
Project description:Complex networks have been successfully used to describe the spread of diseases in populations of interacting individuals. Conversely, pairwise interactions are often not enough to characterize social contagion processes such as opinion formation or the adoption of novelties, where complex mechanisms of influence and reinforcement are at work. Here we introduce a higher-order model of social contagion in which a social system is represented by a simplicial complex and contagion can occur through interactions in groups of different sizes. Numerical simulations of the model on both empirical and synthetic simplicial complexes highlight the emergence of novel phenomena such as a discontinuous transition induced by higher-order interactions. We show analytically that the transition is discontinuous and that a bistable region appears where healthy and endemic states co-exist. Our results help explain why critical masses are required to initiate social changes and contribute to the understanding of higher-order interactions in complex systems.
| S-EPMC6554271 | biostudies-literature
Project description:Various systems in physics, biology, social sciences and engineering have been successfully modeled as networks of coupled dynamical systems, where the links describe pairwise interactions. This is, however, too strong a limitation, as recent studies have revealed that higher-order many-body interactions are present in social groups, ecosystems and in the human brain, and they actually affect the emergent dynamics of all these systems. Here, we introduce a general framework to study coupled dynamical systems accounting for the precise microscopic structure of their interactions at any possible order. We show that complete synchronization exists as an invariant solution, and give the necessary condition for it to be observed as a stable state. Moreover, in some relevant instances, such a necessary condition takes the form of a Master Stability Function. This generalizes the existing results valid for pairwise interactions to the case of complex systems with the most general possible architecture.
| S-EPMC7902853 | biostudies-literature
Project description:A convex code is a binary code generated by the pattern of intersections of a collection of open convex sets in some Euclidean space. Convex codes are relevant to neuroscience as they arise from the activity of neurons that have convex receptive fields. In this paper, we use algebraic methods to determine if a code is convex. Specifically, we use the neural ideal of a code, which is a generalization of the Stanley-Reisner ideal. Using the neural ideal together with its standard generating set, the canonical form, we provide algebraic signatures of certain families of codes that are non-convex. We connect these signatures to the precise conditions on the arrangement of sets that prevent the codes from being convex. Finally, we also provide algebraic signatures for some families of codes that are convex, including the class of intersection-complete codes. These results allow us to detect convexity and non-convexity in a variety of situations, and point to some interesting open questions.
| S-EPMC6750060 | biostudies-literature
Project description:The complex behavior of many systems in nature requires the application of robust methodologies capable of identifying changes in their dynamics. In the case of time series (which are sensed values of a system during a time interval), several methods have been proposed to evaluate their irregularity. However, for some types of dynamics such as stochastic and chaotic, new approaches are required that can provide a better characterization of them. In this paper we present the simplicial complex approximate entropy, which is based on the conditional probability of the occurrence of elements of a simplicial complex. Our results show that this entropy measure provides a wide range of values with details not easily identifiable with standard methods. In particular, we show that our method is able to quantify the irregularity in simulated random sequences and those from low-dimensional chaotic dynamics. Furthermore, it is possible to consistently differentiate cardiac interbeat sequences from healthy subjects and from patients with heart failure, as well as to identify changes between dynamical states of coupled chaotic maps. Our results highlight the importance of the structures revealed by the simplicial complexes, which holds promise for applications of this approach in various contexts.
| S-EPMC10733285 | biostudies-literature
Project description:Networks provide a powerful formalism for modeling complex systems by using a model of pairwise interactions. But much of the structure within these systems involves interactions that take place among more than two nodes at once-for example, communication within a group rather than person to person, collaboration among a team rather than a pair of coauthors, or biological interaction between a set of molecules rather than just two. Such higher-order interactions are ubiquitous, but their empirical study has received limited attention, and little is known about possible organizational principles of such structures. Here we study the temporal evolution of 19 datasets with explicit accounting for higher-order interactions. We show that there is a rich variety of structure in our datasets but datasets from the same system types have consistent patterns of higher-order structure. Furthermore, we find that tie strength and edge density are competing positive indicators of higher-order organization, and these trends are consistent across interactions involving differing numbers of nodes. To systematically further the study of theories for such higher-order structures, we propose higher-order link prediction as a benchmark problem to assess models and algorithms that predict higher-order structure. We find a fundamental difference from traditional pairwise link prediction, with a greater role for local rather than long-range information in predicting the appearance of new interactions.
| S-EPMC6275482 | biostudies-literature
Project description:Conventional embeddings of the edge-graphs of Platonic polyhedra, {f, z}, where f, z denote the number of edges in each face and the edge-valence at each vertex, respectively, are untangled in that they can be placed on a sphere ([Formula: see text]) such that distinct edges do not intersect, analogous to unknotted loops, which allow crossing-free drawings of [Formula: see text] on the sphere. The most symmetric (flag-transitive) realizations of those polyhedral graphs are those of the classical Platonic polyhedra, whose symmetries are *2fz, according to Conway's two-dimensional (2D) orbifold notation (equivalent to Schönflies symbols Ih , Oh , and Td ). Tangled Platonic {f, z} polyhedra-which cannot lie on the sphere without edge-crossings-are constructed as windings of helices with three, five, seven,… strands on multigenus surfaces formed by tubifying the edges of conventional Platonic polyhedra, have (chiral) symmetries 2fz (I, O, and T), whose vertices, edges, and faces are symmetrically identical, realized with two flags. The analysis extends to the "θz " polyhedra, [Formula: see text] The vertices of these symmetric tangled polyhedra overlap with those of the Platonic polyhedra; however, their helicity requires curvilinear (or kinked) edges in all but one case. We show that these 2fz polyhedral tangles are maximally symmetric; more symmetric embeddings are necessarily untangled. On one hand, their topologies are very constrained: They are either self-entangled graphs (analogous to knots) or mutually catenated entangled compound polyhedra (analogous to links). On the other hand, an endless variety of entanglements can be realized for each topology. Simpler examples resemble patterns observed in synthetic organometallic materials and clathrin coats in vivo.
| S-EPMC8740703 | biostudies-literature
Project description:BACKGROUND: The fast growing Protein Data Bank contains the three-dimensional description of more than 45000 protein- and nucleic-acid structures today. The large majority of the data in the PDB are measured by X-ray crystallography by thousands of researchers in millions of work-hours. Unfortunately, lots of structural errors, bad labels, missing atoms, falsely identified chains and groups make dificult the automated processing of this treasury of structural biological data. RESULTS: After we performed a rigorous re-structuring of the whole PDB on graph-theoretical basis, we created the RS-PDB (Rich-Structure PDB) database. Using this cleaned and repaired database, we defined simplicial complexes on the heavy-atoms of the PDB, and analyzed the tetrahedra for geometric properties. CONCLUSION: We have found surprisingly characteristic differences between simplices with atomic vertices of different types, and between the atomic neighborhoods--described also by simplices--of different ligand atoms in proteins.
| S-EPMC2259412 | biostudies-literature
Project description:While brain imaging tools like functional magnetic resonance imaging (fMRI) afford measurements of whole-brain activity, it remains unclear how best to interpret patterns found amid the data's apparent self-organization. To clarify how patterns of brain activity support brain function, one might identify metric spaces that optimally distinguish brain states across experimentally defined conditions. Therefore, the present study considers the relative capacities of several metric spaces to disambiguate experimentally defined brain states. One fundamental metric space interprets fMRI data topographically, that is, as the vector of amplitudes of a multivariate signal, changing with time. Another perspective compares the brain's functional connectivity, that is, the similarity matrix computed between signals from different brain regions. More recently, metric spaces that consider the data's topology have become available. Such methods treat data as a sample drawn from an abstract geometric object. To recover the structure of that object, topological data analysis detects features that are invariant under continuous deformations (such as coordinate rotation and nodal misalignment). Moreover, the methods explicitly consider features that persist across multiple geometric scales. While, certainly, there are strengths and weaknesses of each brain dynamics metric space, wefind that those that track topological features optimally distinguish experimentally defined brain states.
| S-EPMC8233107 | biostudies-literature