相关论文: On Gale and braxial polytopes

In this article, we prove that if all non-trivial cyclic subgroups of a group $G$ are self normalizing and $G$ satisfies the implication $$ \ o(x)\neq o(y)\Rightarrow o(xy)\neq o(x), o(y), $$ for all non-trivial elements $x$ and $y$, then…

Consider a pseudogroup on (C,0) generated by two local diffeomorphisms having analytic conjugacy classes a priori fixed in Diff(C,0). We show that a generic pseudogroup as above is such that every point has (possibly trivial) cyclic…

Let k be a regular F_p-algebra, let A = k[x,y]/(x^b - y^a) be the coordinate ring of a planar cuspical curve, and let I = (x,y) be the ideal that defines the cusp point. We give a formula for the relative K-groups K_q(A,I) in terms of the…

In a graph $G$, a subset of vertices $S \subseteq V(G)$ is said to be cyclable if there is a cycle containing the vertices in some order. $G$ is said to be $k$-cyclable if any subset of $k \geq 2$ vertices is cyclable. If any $k$…

We introduce symplectic billiards for pairs of possibly non-convex polygons. After establishing basic properties, we give several criteria on pairs of polygons for the symplectic billiard map to be fully periodic, i.e. $\textit{every}$…

An $n$-vertex graph is Hamiltonian if it contains a cycle that covers all of its vertices and it is pancyclic if it contains cycles of all lengths from $3$ up to $n$. A celebrated meta-conjecture of Bondy states that every non-trivial…

We prove that the automorphism groups of simple polarized abelian varieties of odd prime dimension over finite fields are cyclic, and give a complete list of finite groups that can be realized as such automorphism groups.

We study $n$-vertex $d$-dimensional polytopes with at most one nonsimplex facet with, say, $d+s$ vertices, called {\it almost simplicial polytopes}. We provide tight lower and upper bound theorems for these polytopes as functions of $d,n$…

A graph is said to be cyclic $k$-edge-connected, if at least $k$ edges must be removed to disconnect it into two components, each containing a cycle. Such a set of $k$ edges is called a cyclic-$k$-edge cutset and it is called a trivial…

Equifacetal simplices, all of whose codimension one faces are congruent to one another, are studied. It is shown that the isometry group of such a simplex acts transitively on its set of vertices, and, as an application, equifacetal…

This article studies a large, general class of orthogonal polytopes which we may call "generic orthotopes". These objects emerged from a desire to represent a Coxeter complex by an orthogonal polytope that is particularly nice with respect…

New criteria for which Cayley graphs of cyclic groups of any order can be completely determined--up to isomorphism--by the eigenvalues of their adjacency matrices is presented. Secondly, a new construction for pairs of nonisomorphic Cayley…

The volume of a cyclic polytope can be obtained by forming an iterated integral along a suitable piecewise linear path running through its edges. Different choices of such a path are related by the action of a subgroup of the combinatorial…

We consider the following generalization of the decomposition theorem for polycycles. A {\em $(R,q)$-polycycle} is, roughly, a plane graph, whose faces, besides some disjoint {\em holes}, are $i$-gons, $i \in R$, and whose vertices, outside…

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…

Unlike the situation in the classical theory of convex polytopes, there is a wealth of semi-regular abstract polytopes, including interesting examples exhibiting some unexpected phenomena. We prove that even an equifacetted semi-regular…

This paper investigates the problem of listing faces of combinatorial polytopes, such as hypercubes, permutahedra, associahedra, and their generalizations. Firstly, we consider the face lattice, which is the inclusion order of all faces of…

Let $\mathcal{P}$ be a chiral polytope with type $\{k_1, k_2\}$ and $G=Aut(\mathcal{P})$. Suppose $|G|=2p^m$, where $k_1, k_2\geq 3$ and $p$ is an odd prime. Let $P$ be a Sylow $p$-subgroup of $G$. We prove that $G \cong P \rtimes…

We focus on two important classes of lattices, the well-rounded and the cyclic. We show that every well-rounded lattice in the plane is similar to a cyclic lattice, and use this cyclic parameterization to count planar well-rounded…

We say that a $k$-uniform hypergraph $C$ is a Hamilton cycle of type $\ell$, for some $1\le \ell \le k$, if there exists a cyclic ordering of the vertices of $C$ such that every edge consists of $k$ consecutive vertices and for every pair…