Related papers: A variation on the Rubik's cube

A Reeb space is defined as the space of all the connected components of inverse images of a smooth map, which is a fundamental tool in studying smooth manifolds using generic smooth maps whose codimensions are not positive such as Morse…

Any $n$-tuple of points in the plane can be moved to any other $n$-tuple by a continuous motion with at most $\binom{n}{3}$ intermediate changes of the order type. Even for tuples with the same order type, the cubic bound is sharp: there…

We investigate the motions of a bar structure consisting of two congruent tetrahedra, whose edges in their basic position form the face diagonals of a rectangular parallelepiped. The constraint of the motion is that the originally…

Suppose that a finite-dimensional cube is orthogonally projected onto a central section of itself by a subspace of one dimension less. Up to dimension $9$, at least one vertex is projected onto the section, but for dimension $10$ or larger,…

The $n$-cube graph is the graph on the vertex set of $n$-tuples of $0$s and $1$s, with two vertices joined by an edge if and only if the $n$-tuples differ in exactly one component. We compute the Smith group of this graph, or, equivalently,…

Given a configuration of pebbles on the vertices of a graph, a pebbling move is defined by removing two pebbles from some vertex and placing one pebble on an adjacent vertex. The cover pebbling number of a graph, gamma(G), is the smallest…

A toy top is defined as a rotationally symmetric body moving in a constant gravitational field while one point on the symmetry axis is constrained to stay in a horizontal plane. It is an integrable system similar to the Lagrange top.…

A general proposition is proved relating multiplicities (of restriction of a representation of a group to a subgroup) under basechange, and used to calculate some multiplicities for cuspidal representations which become principal series…

For any configuration of pebbles on the nodes of a graph, a pebbling move replaces two pebbles on one node by one pebble on an adjacent node. A cover pebbling is a move sequence ending with no empty nodes. The number of pebbles needed for a…

Let $X=(V,E)$ be a finite simple connected graph with $n$ vertices and $m$ edges. A configuration is an assignment of one of two colors, black or white, to each edge of $X.$ A move applied to a configuration is to select a black edge…

Graphings are special bounded-degree graphs on probability spaces, representing limits of graph sequences that are convergent in a local or local-global sense. We describe a procedure for turning the underlying space into a compact metric…

We prove upper bounds on the face numbers of simplicial complexes in terms on their girths, in analogy with the Moore bound from graph theory. Our definition of girth generalizes the usual definition for graphs.

We present a finite-order system of recurrence relations for a permanent of circulant matrices containing a band of k any-value diagonals on top of a uniform matrix (for k = 1, 2, and 3) as well as the method for deriving such recurrence…

Motivated by applications in computational anatomy, we consider a second-order problem in the calculus of variations on object manifolds that are acted upon by Lie groups of smooth invertible transformations. This problem leads to solution…

We apply the orbit method to obtain formula for multiplicities of certain representations of unipotent groups over the finite field.

We show that fundamental groups of compact, orientable, irreducible 3-manifolds with toroidal boundary are Grothendieck rigid.

The target of this article is to discuss the concept of \textit{commuting probability} of finite groups which, in short, is a probabilistic measure of how abelian our group is. We shall compute the value of commuting probability for many…

A pebbling move on a graph removes two pebbles at a vertex and adds one pebble at an adjacent vertex. Rubbling is a version of pebbling where an additional move is allowed. In this new move, one pebble each is removed at vertices $v$ and…

We show that a Kleinian surface group, or hyperbolic 3-manifold with a cusp-preserving homotopy-equivalence to a surface, has bounded geometry if and only if there is an upper bound on an associated collection of coefficients that depend…

We study the geometry of billiard orbits on rectangular billiards. A truncated billiard orbit induces a partition of the rectangle into polygons. We prove that thirteen is a sharp upper bound for the number of different areas of these…