相关论文: Grid polygons from permutations and their enumerat…

Firstly, for a general graph, we find a recursion formula on the number of Hamiltonian cycles and one on cycles. By this result, we give some new polynomial invariants. Secondly, we give a condition to tell whether a polynomial defined by…

The purpose of the present article is to examine the essence of what has commonlybeen described as a "projective line", but which is here named a "meridian". This shall be done in several papers: this first paper devoted to the meridian…

Any set of $\sigma$-Hermitian matrices of size $n \times n$ over a field with involution $\sigma$ gives rise to a projective line in the sense of ring geometry and a projective space in the sense of matrix geometry. It is shown that the two…

NOTE: this is a shortened version of the abstract of the paper. Multigrid methods for propagators in gauge fields are investigated. Gauge fields are incorporated in algorithms in a covariant way. This avoids the necessity for gauge fixing…

A two-dimensional grid consists of vertices of the form (i,j) for 1 \leq i \leq m and 1 \leq j \leq n, for fixed m,n > 1. Two vertices are adjacent if the \ell_1 distance between their vectors is equal to 1. A landmark set is a subset of…

The multigrid algorithm is an efficient numerical method for solving a variety of elliptic partial differential equations (PDEs). The method damps errors at progressively finer grid scales, resulting in faster convergence compared to…

We characterize separable multidimensional permutations in terms of forbidden patterns and enumerate them by means of generating function, recursive formula and explicit formula. We find a connection between multidimensional permutations…

The extension complexity of a polytope $P$ is the smallest integer $k$ such that $P$ is the projection of a polytope $Q$ with $k$ facets. We study the extension complexity of $n$-gons in the plane. First, we give a new proof that the…

We derive a mixed integer nonlinear programming formulation for the problem of finding a convex polygon with a given number of vertices that is small (diameter at most one) and has maximum perimeter. The formulation is based on a geometric…

We introduce a special subset of the graph of a homogeneous coupled cell network, called a projection block, and show that the network obtained from identifying this block to a single point can be used to understand the generic bifurcations…

In this paper we present a characterisation, by an infinite family of minimal forbidden induced subgraphs, of proper circular arc graphs which are intersection graphs of paths on a grid, where each path has at most one bend (turn).

A network embedding is a representation of a large graph in a low-dimensional space, where vertices are modeled as vectors. The objective of a good embedding is to preserve the proximity between vertices in the original graph. This way,…

We prove that the basis and the generating function of a geometric grid class of permutations Geom$(M)$ are computable from the matrix $M$, as well as some variations on this result. Our main tool is monadic second-order logic on…

Let k be a perfect field and let K/k be a finite extension of fields. An arithmetic noncommutative projective line is a noncommutative space equal to the projectivization of the noncommutative symmetric algebra of a k-central two -sided…

Graded vector bundles over a given $\mathbb{Z}$-graded manifold can be defined in three different ways: certain sheaves of graded modules over the structure sheaf of the base graded manifold, finitely generated projective graded modules…

A fullerene graph can be embedded in a piecewise linear 2-manifold with each non-hexagonal carbon ring corresponding to a cone vertex. Adjacent two or three such vertices can be combined as a cluster cut out from a parent cone round a…

The aim of this paper is to classify reduction types of algebraic curves. Reduction types capture the discrete invariants of fibres in one-dimensional families of curves, and they have been described in genus 1, 2 and 3. For fixed genus…

The representation number of a graph is the minimum number of copies of each vertex required to represent the graph as a word, such that the letters corresponding to vertices $x$ and $y$ alternate if and only if $xy$ is an edge in the…

The straight skeleton of a polygon is the geometric graph obtained by tracing the vertices during a mitered offsetting process. It is known that the straight skeleton of a simple polygon is a tree, and one can naturally derive directions on…

Polypolyhedra are edge-transitive compounds of polyhedra. In this paper we use group theory to determine the number of distinct polypolyhedra whose symmetry group is any given finite irreducible Coxeter group. We apply this result in order…