相关论文: Fully Packed Loop configurations in a triangle

Block designs are combinatorial structures in which each pair of a set of varieties appears together in a fixed number of blocks. Complete graphs are graphs in which every pair of vertices are adjacent. We present some new constructions of…

This work studies the problem of searching for homogeneous polynomial Lyapunov functions for stable switched linear systems. Specifically, we show an equivalence between polynomial Lyapunov functions for systems of this class and quadratic…

The aim of this paper is to generalize the notion of conformal blocks to the situation in which the Lie algebra they are attached to is not defined over a field, but depends on covering data of curves. The result will be a sheaf of…

Thurston's equations determine the hyperbolic structure of a 3-manifold with a triangulation. In work by Thistlethwaite and Tsvietkova, an alternative method was developed for link complements in $S^3$ depending on the link diagram, where a…

A $configuration$ of a linkage $\Gamma$ is a possible positioning of $\Gamma$ in $\mathbb{R}^d$ and the collection of all such forms the configuration space $\mathcal{C}(\Gamma)$ of $\Gamma$. We here introduce the notion of the $symmetric…

We study a simple geometric model for local transformations of bipartite graphs. The state consists of a choice of a vector at each white vertex made in such a way that the vectors neighboring each black vertex satisfy a linear relation.…

The expansion $F^{\triangle}$ of a graph $F$ is the graph obtained from $F$ by replacing each edge with a triangle. Lv \etal proposed a conjecture on the maximum number of triangles in a graph without $P_k^{\triangle}$ or $C_k^{\triangle}$…

The set of triangulations of a cyclic polytope possesses two a priori different partial orders, known as the higher Stasheff-Tamari orders. The first of these orders was introduced by Kapranov and Voevodsky, while the second order was…

In this paper, we propose linear maps over the space of all polynomials $f(x)$ in $\mathbb{F}_q[x]$ that map $0$ to itself, through their evaluation map. Properties of these linear maps throw up interesting connections with permutation…

The Chinese Remainder Theorem for the integers says that every system of congruence equations is solvable as long as the system satisfies an obvious necessary condition. This statement can be generalized in a natural way to arbitrary…

A triangulation of a point configuration is regular if it can be given by a height function, that is every point gets lifted to a certain height and projecting the lower convex hull gives the triangulation. Checking regularity of a…

Configurations are necklaces with prescribed numbers of red and black beads. Among all possible configurations, the regular one plays an important role in many applications. In this paper, several aspects of regular configurations are…

Flips of diagonals in colored triangle-free triangulations of a convex polygon are interpreted as moves between two adjacent chambers in a certain graphic hyperplane arrangement. Properties of geodesics in the associated flip graph are…

For arbitrary F-algebra, in which the operation of addition is defined, I explore biring of matrices of mappings. The sum of matrices is determined by the sum in F-algebra, and the product of matrices is determined by the product of…

Using the Fundamental-Measure Density Functional Theory, we have studied theoretically the phase behavior of extremely confined mixtures of parallel hard squares in slit geometry. The pore width is chosen such that configurations consisting…

A binary extended 1-perfect code $\mathcal C$ folds over its kernel via the Steiner quadruple systems associated with its codewords. The resulting folding, proposed as a graph invariant for $\mathcal C$, distinguishes among the 361…

This note is a complete library of symbolic parametrized expressions for both real and complexified configuration spaces of a spherical 4-bar linkage. Building upon the previous work from Izmestiev, (2016, Section 2), this library expands…

Fixed-size commutative rings are quasi-ordered such that all scalar linearly solvable networks over any given ring are also scalar linearly solvable over any higher-ordered ring. As consequences, if a network has a scalar linear solution…

In this paper, we define real link Floer homology for strongly invertible and doubly periodic links in closed real $3$-manifolds with connected fixed sets, which generalizes real Heegaard Floer homology and real sutured Heegaard Floer…

After defining convex near-polygons, a formula enumerating the number of triangulations of such configurations is derived in terms of edge-polynomials. The paper describes also a transfer-matrix approach for computing quantities related to…