Related papers: Gluing polynomials along the circle

We develop a gluing theory in the sense of Koll\'{a}r for slc surfaces and threefolds in positive characteristic. For surfaces we are able to deal with every positive characteristic $p$, while for threefolds we assume that $p>5$. Along the…

We prove that for every smooth Jordan curve $\gamma \subset \mathbb{C}$ and for every set $Q \subset \mathbb{C}$ of six concyclic points, there exists a non-constant quadratic polynomial $p \in \mathbb{C}[z]$ such that $p(Q) \subset…

It is well known that the SU(2)-gauge invariant phase space of loop gravity can be represented in terms of twisted geometries. These are piecewise-linear-flat geometries obtained by gluing together polyhedra, but the resulting geometries…

This paper studies cutting and pasting groups (SK-groups) of pairs of manifolds. By a pair of manifolds we mean a manifold with a submanifold of strictly smaller dimension. Existing results in the unoriented category by Komiya are…

Graph polynomials are polynomials assigned to graphs. Interestingly, they also arise in many areas outside graph theory as well. Many properties of graph polynomials have been widely studied. In this paper, we survey some results on the…

We investigate how to make the surface of a convex polyhedron (a polytope) by folding up a polygon and gluing its perimeter shut, and the reverse process of cutting open a polytope and unfolding it to a polygon. We explore basic enumeration…

Dipole words are sequences of magnetic dipoles, in which alike elements repel and opposite elements attract. Magnetic dipoles contrast with more general sets of bonding types, called glues, in which pairwise bonding strength is specified by…

Mating is an operation that identifies the domains of a polynomial pair in order to obtain a new map on the resulting quotient space. The dynamics of the mating are then dependent on the two polynomials and the manner in which the quotient…

The interplay between the topological and geometrical properties of a polymer ring can be clarified by establishing the entanglement trapped in any portion (arc) of the ring. The task requires to close the open arcs into a ring, and the…

Given a convex polyhedral surface P, we define a tailoring as excising from P a simple polygonal domain that contains one vertex v, and whose boundary can be sutured closed to a new convex polyhedron via Alexandrov's Gluing Theorem. In…

Motivated by the problem of redistricting, we study area-preserving reconfigurations of connected subdivisions of a simple polygon. A connected subdivision of a polygon $\mathcal{R}$, called a district map, is a set of interior disjoint…

A new generalization of Grassmannians in supergeometry, called $\nu-$Grassmannians, are constructed by gluing $\nu-$domains. By a $\nu-$domain, we mean a superdomain with an odd involution say $\nu$ on its structure sheaf, as morphism of…

In this paper we discuss different properties of noncommutative schemes over a field. We define a noncommutative scheme as a differential graded category of a special type. We study regularity, smoothness and properness for noncommutative…

This paper introduces gluing diagrams a combinatorial tool to construct homomorphisms between the shift pseudogroups of directed graphs and thus also their full groups of shifts. We will establish which of these diagrams produce…

This paper presents an alternative approach to simplify the proofs of some important results related to polynomial mappings in Computational Algebraic Geometry such as Polynomial Implicitization, Image Closure and some properties of the…

Given two semigroups $\langle A\rangle$ and $\langle B\rangle$ in ${\mathbb N}^n$, we wonder when they can be glued, i.e., when there exists a semigroup $\langle C\rangle$ in ${\mathbb N}^n$ such that the defining ideals of the…

In this paper, our aim is twofold: First, by using the technique of gluing semigroups, we give infinitely many families of a projective closure with the Cohen-Macaulay (Gorenstein) property. Also, we give an effective technique for…

We give a complete description of all convex polyhedra whose surface can be constructed from several congruent regular pentagons by folding and gluing them edge to edge. Our method of determining the graph structure of the polyhedra from a…

We give an explicit combinatorial proof of a weighted version of strong log-concavity for the generating polynomial of increasing spanning forests of a finite simple graph equipped with a total ordering of the vertices. In contrast to…

Geometric modeling by constraints, whose applications are of interest to communities from various fields such as mechanical engineering, computer aided design, symbolic computation or molecular chemistry, is now integrated into standard…