相关论文: Parallel-product decomposition of edge-transitive …

We consider the problem of enumerating d-irreducible maps, i.e. planar maps whose all cycles have length at least d, and such that any cycle of length d is the boundary of a face of degree d. We develop two approaches in parallel: the…

Given a semigroup of local homeomorphisms on a compact space X we consider the corresponding semigroup of *-endomorphisms on C(X) and discuss the possibility of extending it to an interaction group, a concept recently introduced by the…

The pentagram map is a discrete dynamical system on planar polygons. By definition, the image of a polygon $P$ under the pentagram map is the polygon $P'$ whose vertices are the intersection points of consecutive shortest diagonals of $P$.…

Symmetric edge polytopes of graphs are important object in Ehrhart theory,and have an application to Kuramoto models. In the present paper, we study the upper and lower bounds for the number of facets of symmetric edge polytopes of…

The edge-reconstruction number of graph $G$, denoted $ern(G)$,is the size of the smallest multiset of edge-deleted, unlabeled subgraphs of $G$, from which the structure of $G$ can be uniquely determined. That there was some connection…

The first aim of this work is to characterize when the lattice of all submodules of a module is a direct product of two lattices. In particular, which decompositions of a module $M$ produce these decompositions: the \emph{lattice…

A graph covering projection, also referred to as a locally bijective homomorphism, is a mapping between the vertices and edges of two graphs that preserves incidences and is a local bijection. This concept originates in topological graph…

Let $G$ be a finite connected simple graph with $d$ vertices and let $\Pc_G \subset \RR^d$ be the edge polytope of $G$. We call $\Pc_G$ \emph{decomposable} if $\Pc_G$ decomposes into integral polytopes $\Pc_{G^+}$ and $\Pc_{G^-}$ via a…

We resolve in the affirmative conjectures of Repovs and A. Skopenkov (1998), and M. Skopenkov (2003) generalizing the classical Hanani-Tutte theorem to the setting of approximating maps of graphs on 2-dimensional surfaces by embeddings. Our…

We study graph parameters whose associated edge-connection matrices have exponentially bounded rank growth. Our main result is an explicit construction of a large class of graph parameters with this property that we call mixed partition…

We describe an infinite family of edge-decompositions of complete graphs into two graphs, each of which triangulate the same orientable surface. Previously, such decompositions had only been known for only a few complete graphs. These…

We show that the parallel transport map over a reductive homogeneous space with natural torsion-free connection becomes an affine submersion with horizontal distribution. This generalizes one of the main results in the author's previous…

We call a finite undirected graph minimally k-matchable if it has at least k distinct perfect matchings but deleting any edge results in a graph which has not. An odd subdivision of some graph G is any graph obtained by replacing every edge…

Recently the author has introduced cobordism-like modules induced from generic maps whose codimensions are negative. They are generalizations of cobordism modules of manifolds. They have been introduced in generalizing the following theorem…

A commutative ring is reduced when it can be embedded into a direct product of fields. While the category of reduced commutative rings plays a fundamental role in affine geometry, it exhibits several structural deficiencies: it admits…

We show that if E is an equivalence of upper semicontinuous Fell bundles B and C over groupoids, then there is a linking bundle L(E) over the linking groupoid L such that the full cross-sectional algebra of L(E) contains those of B and C as…

We introduce a class of cycles, called nondegenerate, strictly decomposable cycles, and show that the image of each cycle in this class under the refined cycle map to an extension group in the derived category of arithmetic mixed Hodge…

In [8], Arveson proved that a $1$-parameter decomposable product system is isomorphic to the product system of a CCR flow. We show that the structure of a generic decomposable product system, over higher dimensional cones, modulo twists by…

A matching $M$ in a graph $G$ is $r$-degenerate if the subgraph of $G$ induced by the set of vertices incident with an edge in $M$ is $r$-degenerate. Goddard, Hedetniemi, Hedetniemi, and Laskar (Generalized subgraph-restricted matchings in…

A graph is edge-transitive if the natural action of its automorphism group on its edge set is transitive. An automorphism of a graph is semiregular if all of the orbits of the subgroup generated by this automorphism have the same length.…