Related papers: Products of Foldable Triangulations
Tight triangulations are exotic, but highly regular objects in combinatorial topology. A triangulation is tight if all its piecewise linear embeddings into a Euclidean space are as convex as allowed by the topology of the underlying…
Information on su(N) tensor product multiplicities is neatly encoded in Berenstein-Zelevinsky triangles. Here we study a generalisation of these triangles by allowing negative as well as non-negative integer entries. For a fixed triple…
A pseudo-triangle is a simple polygon with three convex vertices, and a pseudo-triangulation is a face-to-face tiling of a planar region into pseudo-triangles. Pseudo-triangulations appear as data structures in computational geometry, as…
We compare the predictions of two different statistical mechanics approaches, corresponding to different physical measurements, proposed to describe binary granular mixtures subjected to some external driving (continuous shaking or tap…
Some properties of generalized convexity for sets and for functions are identified in case of the reliability polynomials of two dual minimal networks. A method of approximating the reliability polynomials of two dual minimal network is…
We develop a general geometric method to establish the existence of positive Lyapunov exponents for a class of skew products. The technique is applied to show non-uniform hyperbolicity of some conservative partially hyperbolic…
It is well known by analysts that a concept lattice has an exponential size in the data. Thus, as soon as he works with real data, the size of the concept lattice is a fundamental problem. In this chapter, we propose to investigate factor…
Let $\G$ denote a bipartite distance-regular graph with vertex set $X$ and diameter $D \ge 3$. Fix $x \in X$ and let $L$ (resp. $R$) denote the corresponding lowering (resp. raising) matrix. We show that each $Q$-polynomial structure for…
This paper investigates flat webs on the projective plane. We present two methods for constructing such webs: the first involves taking the product of finitely many convex reduced foliations and invariant lines, while the second consists of…
We study inheritance of path-pairability in the Cartesian product of graphs, and prove different (such as additive and multiplicative) inheritance patterns of path-pairability, depending on the size of the Cartesian product. We present…
We consider tiling rectangles of size 4m x 4n by T-shaped tetrominoes. Each tile is assigned a weight that depends on its orientation and position on the lattice. For a particular choice of the weights, the generating function of tilings is…
We define triangulated factorization systems on triangulated categories, and prove that a suitable subclass thereof (the normal triangulated torsion theories) corresponds bijectively to $t$-structures on the same category. This result is…
The generating function for restricted partitions is a finite product with a Laurent expansion at each root of unity. The question of the behavior of these Laurent coefficients as the size of the product increases goes back to Rademacher…
The Tutte polynomial is a classical invariant, important in combinatorics and statistical mechanics. An essential feature of the Tutte polynomial is the duality for planar graphs G, $T_G(X,Y)\; =\; {T}_{G^*}(Y,X)$ where $G^*$ denotes the…
In factoring matrices into the product of two matrices operations are typically performed with elements restricted to matrix subspaces. Such modest structural assumptions are realistic, for example, in large scale computations. This paper…
We present computational methods for constructing orthogonal/orthonormal polynomials over arbitrary polygonal domains in $\mathbb{R}^2$ using bivariate spline functions. Leveraging a mature MATLAB implementation which generates spline…
We define the twisted tensor product of two enriched categories, which generalizes various sorts of `products' of algebraic structures, including the bicrossed product of groups, the twisted tensor product of (co)algebras and the double…
Bipartite calculus is a direct generalization of Kauffman planar expansion from $N=2$ to arbitrary $N$, applicable to the restricted class of knots which are entirely made of antiparallel lock tangles. Whenever applicable, it allows a…
The aim of this paper is to show that any finite undirected bipartite graph can be considered as a polynomial $p \in \mathbb{N}[x]$, and any directed finite bipartite graph can be considered as a polynomial $p\in\mathbb{N}[x,y]$, and vise…
Bidiagonal matrices are widespread in numerical linear algebra, not least because of their use in the standard algorithm for computing the singular value decomposition and their appearance as LU factors of tridiagonal matrices. We show that…