相关论文: Exact enumeration of fullerenes
The $k$-token graph $T_k(G)$ is the graph whose vertices are the $k$-subsets of vertices of a graph $G$, with two vertices of $T_k(G)$ adjacent if their symmetric difference is an edge of $G$. We explore when $T_k(G)$ is a well-covered…
A rectangulation is a tiling of a rectangle by a finite number of rectangles. The rectangulation is called generic if no four of its rectangles share a single corner. We initiate the enumeration of generic rectangulations up to…
A unitary (Euclidean) representation of a quiver is given by assigning to each vertex a unitary (Euclidean) vector space and to each arrow a linear mapping of the corresponding vector spaces. We recall an algorithm for reducing the matrices…
Let $\mathrm{rex}(n, F)$ denote the maximum number of edges in an $n$-vertex graph that is regular and does not contain $F$ as a subgraph. We give lower bounds on $\mathrm{rex}(n, F)$, that are best possible up to a constant factor, when…
A (general) polygonal line tiling is a graph formed by a string of cycles, each intersecting the previous at an edge, no three intersecting. In 2022, Matsushita proved the matching complex of a certain type of polygonal line tiling with…
A bilinear quadrature numerically evaluates a continuous bilinear map, such as the $L^2$ inner product, on continuous $f$ and $g$ belonging to known finite-dimensional function spaces. Such maps arise in Galerkin methods for differential…
We propose a novel strategy that permits the construction of completely general five-dimensional microstate geometries on a Gibbons-Hawking space. Our scheme is based on two steps. First, we rewrite the bubble equations as a system of…
Any moduli space of representations of a quiver (possibly with oriented cycles) has an embedding as a dense open subvariety into a moduli space of representations of a bipartite quiver having the same type of singularities. A connected…
We consider a compact hyperbolic tetrahedron of a general type. It is a convex hull of four points called vertices in the hyperbolic space $\mathbb{H}^3$. It can be determined by the set of six edge lengths up to isometry. For further…
We apply Diophantine analysis to classify edge-to-edge tilings of the sphere by congruent almost equilateral quadrilaterals (i.e., edge combination a3b). Parallel to a complete classification by Cheung, Luk and Yan, the method implemented…
Atkinson [2] found a sequence of three-dimensional hyperbolic polyhedra whose dihedral angles are $\pi /3$. In this paper, we construct another sequence of such polyhedra. We also determine the volumes of some of these polyhedra.
Transversal structures (also known as regular edge labelings) are combinatorial structures defined over 4-connected plane triangulations with quadrangular outer-face. They have been intensively studied and used for many applications…
We determine all non-edge-to-edge tilings of the sphere by regular spherical polygons of three or more sides.
We classify the dihedral edge-to-edge tilings of the sphere by regular polygons and quadrilaterals with equal opposite edges (edge configuration xyxy).
Blaschke factorization allows us to write any holomorphic function $F$ as a formal series $$ F = a_0 B_0 + a_1 B_0 B_1 + a_2 B_0 B_1 B_2 + \cdots$$ where $a_i \in \mathbb{C}$ and $B_i$ is a Blaschke product. We introduce a more general…
Symmetric edge polytopes, also called adjacency polytopes, are lattice polytopes determined by simple undirected graphs. We introduce the integer array \(\mathrm{maxf}(n,m)\) giving the maximum number of facets of a symmetric edge polytope…
We propose a method to extend into the bulk asymptotically flat static spherically symmetric brane-world metrics. We employ the multipole (1/r) expansion in order to allow exact integration of the relevant equations along the (fifth) extra…
We describe the structure of the different hexagonal grids in dimension d=3, propose short notation for them, investigate the contact numbers of ball packings in these grids and share some computational results up to 200 balls, using mainly…
An electron in quantum confinement takes on a discrete energy spectrum which is defined based on the solution to the Schrodinger Equation for a given potential. Well defined closed-form energy spectra are known for the particle in a box,…
The Illumination Problem may be phrased as the problem of covering a convex body in Euclidean $n$-space by a minimum number of translates of its interior. By a probabilistic argument, we show that, arbitrarily close to the Euclidean ball,…