Related papers: A combinatorial procedure for tilting mutation
Various specifiable combinatorial structures, with d extensive parameters, can be exactly sampled both by the recursive method, with linear arithmetic complexity if a heavy preprocessing is performed, or by the Boltzmann method, with…
This paper is intended to provide an introduction to the theory of substitution tilings. For our purposes, tiling substitution rules are divided into two broad classes: geometric and combinatorial. Geometric substitution tilings include…
We develop the structure theory for transformations of weakly geometric rough paths of bounded $1 < p$-variation and their controlled paths. Our approach differs from existing approaches as it does not rely on smooth approximations. We…
We consider a general concept of composition and decomposition of objects, and discuss a few natural properties one may expect from a reasonable choice thereof. It will be demonstrated how this leads to multiplication and co- multiplication…
A gentle algebra gives rise to a dissection of an oriented marked surface with boundary into polygons and the bounded derived category of the gentle algebra has a geometric interpretation in terms of this surface. In this paper we study…
From the viewpoint of mutation, we will give a brief survey of tilting theory and cluster-tilting theory together with a motivation from cluster algebras. Then we will give an introdution to \tau-tilting theory which was recently developed…
A filtration of a representation whose successive quotients are isomorphic to Demazure modules is called an excellent filtration. In this paper we study graded multiplicities in excellent filtrations of fusion products for the current…
This paper examines a general method for producing twists of a comodule algebra by tensoring it with a torsor then taking co-invariants. We examine the properties that pass from the original algebra to the twisted algebra and vice versa. We…
The motivation of this work is to define cohomology classes in the space of knots that are both easy to find and to evaluate, by reducing the problem to simple linear algebra. We achieve this goal by defining a combinatorial graded cochain…
Framed combinatorial topology is a novel theory describing combinatorial phenomena arising at the intersection of stratified topology, singularity theory, and higher algebra. The theory synthesizes elements of classical combinatorial…
Transform Invariant Low-rank Textures (TILT) is a novel and powerful tool that can effectively rectify a rich class of low-rank textures in 3D scenes from 2D images despite significant deformation and corruption. The existing algorithm for…
We construct a binary mutation invariant for skew-symmetric integer matrices. The invariant is not an integer congruence invariant for matrices of odd size: we provide examples of congruent such matrices with different values for the…
Density operators are one of the key ingredients of quantum theory. They can be constructed in two ways: via a convex sum of `doubled kets' (i.e. mixing), and by tracing out part of a `doubled' two-system ket (i.e. dilation). Both…
A lift-and-permute scheme of alternating direction method of multipliers (ADMM) is proposed for linearly constrained convex programming. It contains not only the newly developed balanced augmented Lagrangian method and its dual-primal…
A finite-dimensional unital and associative algebra over $\mathbb{R}$, or what we shall call simply "an algebra" in this paper for short, generalities the construction by which we derive the complex numbers by "adjoining an element $i$" to…
In the 1980s, Harada introduced a new class of algebras now called Harada algebras. Harada algebras provides us with a rich source of Auslander's 1-Gorenstein algebras. In this paper, we have two main results about Harada algebras. The…
The set of non-linear equations describing the Standard Model kinematics of the top quark antiqark production system in the dilepton decay channel has at most a four-fold ambiguity due to two not fully reconstructed neutrinos. Its most…
We consider maximal non-$l$-intertwining collections, which are a higher-dimensional version of the maximal non-crossing collections which give clusters of Pl\"ucker coordinates in the Grassmannian coordinate ring, as described by Scott. We…
Rectangulations are partitions of a square into axis-aligned rectangles. A number of results provide bijections between combinatorial equivalence classes of rectangulations and families of pattern-avoiding permutations. Other results deal…
Modified Direct Method (MDM) is an iterative scheme based on Jacobi iterations for smoothing planar meshes [4]. The basic idea behind MDM is to make any triangular element be as close to an equilateral triangle as possible. Basedon the MDM,…