Related papers: A combinatorial procedure for tilting mutation
A large family of linear, usually overdetermined, systems of partial differential equations that admit a multiplication of solutions, i.e, a bi-linear and commutative mapping on the solution space, is studied. This family of PDE's contains…
We study some homological invariants of a given generalized bound path algebra in terms of those of the algebras used in its construction. We discuss the particular case where the algebra is a generalized path algebra and give conditions…
This paper introduces a new systematic algorithm for constructing periodic Euclidean weaving diagrams with combinatorial arguments. It is shown that such a weaving diagram can be considered as a specific type of four-regular periodic planar…
We generalize the shuffle theorem and its $(km,kn)$ version, as conjectured by Haglund et al. and Bergeron et al., and proven by Carlsson and Mellit, and Mellit, respectively. In our version the $(km,kn)$ Dyck paths on the combinatorial…
We construct a tilting object for the stable category of vector bundles on a weighted projective line X of type (2,2,2,2;\lambda), consisting of five rank two bundles and one rank three bundle, whose endomorphism algebra is a canonical…
Reciprocal transformations mix the role of the dependent and independent variables to achieve simpler versions or even linearized versions of nonlinear PDEs. These transformations help in the identification of a plethora of PDEs available…
We apply tilting theory over preprojective algebras $Lambda$ to a study of moduli space of $Lambda$-modules. We define the categories of semistable modules and give an equivalence, so-called reflection functors, between them by using…
Alternating direction multiplication is a powerful technique for solving convex optimisation problems. When challenging subproblems are encountered in the real world, it is useful to solve them by introducing neighbourhood terms. When the…
The binomial interpolated transform of a sequence is a generalization of the well-known binomial transform. We examine a Pascal-like triangle, on which a binomial interpolated transform works between the left and right diagonals, focusing…
The commutative trigonometric shuffle algebra ${\mathrm A}$ is a space of symmetric rational functions satisfying certain wheel conditions. We describe a ring isomorphism between ${\mathrm A}$ and the center of the Hecke algebra using a…
Let $A = \Bbbk Q / I$ be the path algebra of any finite quiver $Q$ modulo any two-sided ideal $I$ of relations and let $R$ be any reduction system satisfying the diamond condition for $I$. We introduce an intrinsic notion of deformation of…
This article is an expository account of the theory of twisted commutative algebras, which simply put, can be thought of as a theory for handling commutative algebras with large groups of linear symmetries. Examples include the coordinate…
An algorithm is described for the construction of actions for scalar, spinor, and vector gauge fields that remains well-defined when the metric is degenerate and that involve no contravariant tensor fields. These actions produce the…
The concept of modulation is generalized to pseudo-modulation and its subclasses including pre-modulation, generalized modulation and regular modulation. The motivation is to define the valued analogue of natural quiver, called {\em natural…
In this paper we investigate the possibility of constructing a complete quantization procedure consisting of geometric and deformation quantization. The latter assigns a noncommutative algebra to a symplectic manifold, by deforming the…
We relate the notions of BB-tilting and perverse derived equivalence at a vertex. Based on these notions, we define mutations of algebras, leading to derived equivalent ones. We present applications to endomorphism algebras of…
In this paper we present a topological framework for studying signed permutations and their reversal distance. As a result we can give an alternative approach and interpretation of the Hannenhalli-Pevzner formula for the reversal distance…
Counting the number of permutations of a given total displacement is equivalent to counting weighted Motzkin paths of a given area (Guay-Paquet and Petersen, 2014). The former combinatorial problem is still open. In this work, we show that…
In this paper I present a conjecture for a recursive algorithm that finds each permutation of combining two sets of objects (AKA the Shuffle Product). This algorithm provides an efficient way to navigate this problem, as each atomic…
Recent advancements in quantum computing and quantum-inspired algorithms have sparked renewed interest in binary optimization. These hardware and software innovations promise to revolutionize solution times for complex problems. In this…