In geometry, a vertex configuration is a shorthand notation for representing the vertex figure of a polyhedron or tiling as the sequence of faces around a vertex. For uniform polyhedra there is only one vertex type and therefore the vertex configuration fully defines the polyhedron. (Chiral polyhedra exist in mirror-image pairs with the same vertex configuration.)
A vertex configuration is given as a sequence of numbers representing the number of sides of the faces going around the vertex. The notation "a.b.c" describes a vertex that has 3 faces around it, faces with a, b, and c sides.
For example, "3.5.3.5" indicates a vertex belonging to 4 faces, alternating triangles and pentagons. This vertex configuration defines the vertex-transitive icosidodecahedron. The notation is cyclic and therefore is equivalent with different starting points, so 3.5.3.5 is the same as 5.3.5.3. The order is important, so 3.3.5.5 is different from 3.5.3.5 (the first has two triangles followed by two pentagons). Repeated elements can be collected as exponents so this example is also represented as (3.5)_2.
It has variously been called a vertex description, vertex type, vertex symbol, vertex arrangement, vertex pattern, face-vector. It is also called a Cundy and Rollett symbol for its usage for the Archimedean solids in their 1952 book Mathematical Models.
A vertex configuration can also be represented as a polygonal vertex figure showing the faces around the vertex. This vertex figure has a 3-dimensional structure since the faces are not in the same plane for polyhedra, but for vertex-uniform polyhedra all the neighboring vertices are in the same plane and so this plane projection can be used to visually represent the vertex configuration.
Different notations are used, sometimes with a comma (,) and sometimes a period (.) separator. The period operator is useful because it looks like a product and an exponent notation can be used. For example, 3.5.3.5 is sometimes written as (3.5)2.
The notation can also be considered an expansive form of the simple Schläfli symbol for regular polyhedra.
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
The students learn the theory and practice of basic concepts and techniques in algorithms. The course covers mathematical induction, techniques for analyzing algorithms, elementary data structures, ma
This course is an introduction to linear and discrete optimization.Warning: This is a mathematics course! While much of the course will be algorithmic in nature, you will still need to be able to p
In geometry, a spherical polyhedron or spherical tiling is a tiling of the sphere in which the surface is divided or partitioned by great arcs into bounded regions called spherical polygons. Much of the theory of symmetrical polyhedra is most conveniently derived in this way. The most familiar spherical polyhedron is the soccer ball, thought of as a spherical truncated icosahedron. The next most popular spherical polyhedron is the beach ball, thought of as a hosohedron.
In geometry, the triangular tiling or triangular tessellation is one of the three regular tilings of the Euclidean plane, and is the only such tiling where the constituent shapes are not parallelogons. Because the internal angle of the equilateral triangle is 60 degrees, six triangles at a point occupy a full 360 degrees. The triangular tiling has Schläfli symbol of {3,6}. English mathematician John Conway called it a deltille, named from the triangular shape of the Greek letter delta (Δ).
In geometry, a truncated icosidodecahedron, rhombitruncated icosidodecahedron, great rhombicosidodecahedron, omnitruncated dodecahedron or omnitruncated icosahedron is an Archimedean solid, one of thirteen convex, isogonal, non-prismatic solids constructed by two or more types of regular polygon faces. It has 62 faces: 30 squares, 20 regular hexagons, and 12 regular decagons. It has the most edges and vertices of all Platonic and Archimedean solids, though the snub dodecahedron has more faces.
Covers the Feynman Rules and contractions in Quantum Field Theory, emphasizing momentum conservation and symmetry factor in diagrams.
, ,
We demonstrate the importance of addressing the F vertex and thus going beyond the GW approximation for achieving the energy levels of liquid water in manybody perturbation theory. In particular, we consider an effective vertex function in both the polariz ...
We extend the quasiparticle self-consistent approach beyond the GW approximation by using a range separated vertex function. The developed approach yields band gaps, dielectric constants, and band positions with an accuracy similar to highest-level electro ...
2021
, , ,
Given a source of iid samples of edges of an input graph G with n vertices and m edges, how many samples does one need to compute a constant factor approximation to the maximum matching size in G? Moreover, is it possible to obtain such an estimate in a sm ...