Related papers: Lotuses as computational architectures
Joyce vertex algebras are vertex algebra structures defined on the homology of certain $\mathbb{C}$-linear moduli stacks, and are used to express wall-crossing formulae for Joyce's homological enumerative invariants. This paper studies the…
This article considers some affine algebraic varieties attached to finite trees and closely related to cluster algebras. Their definition involves a canonical coloring of vertices of trees into three colors. These varieties are proved to be…
We establish an identification between the spaces of $\alpha$-fusion trees in non-semisimple topological quantum computation (NSS TQC) and a family of homological representations of the braid group known as the Lawrence representations…
We study the problem of desingularizing coassociative conical singularities via gluing, allowing for topological and analytic obstructions, and discuss applications. This extends the author's earlier work on the unobstructed case. We…
It is well known that for a first order system of linear difference equations with rational function coefficients, a solution that is holomorphic in some left half plane can be analytically continued to a meromorphic solution in the whole…
Constraint problems can be trivially solved in parallel by exploring different branches of the search tree concurrently. Previous approaches have focused on implementing this functionality in the solver, more or less transparently to the…
For a given permutation or set partition there is a natural way to assign a genus. Counting all permutations or partitions of a fixed genus according to cycle lengths or block sizes, respectively, is the main content of this article. After…
In this paper we show how to split the Root Locus plot for an irreducible rational transfer function into several individual algebraic plane curves, like lines, circles, conics, etc. To achieve this goal we use results of a previous paper…
A family of quantum cluster algebras is introduced and studied. In general, these algebras are new, but subclasses have been studied previously by other authors. The algebras are indexed by double partitions or double flag varieties.…
We extend the notion of (smooth) stable generalized complex structures to allow for an anticanonical section with normal self-crossing singularities. This weakening not only allows for a number of natural examples in higher dimensions but…
Simplicial complexes are higher-order combinatorial structures which have been used to represent real-world complex systems. In this paper, we concentrate on the local patterns in simplicial complexes called simplets, a generalization of…
Galaxies are thought to reside inside of large gravitationally bound structures of dark matter, so-called haloes. While the smallest of these haloes host no or only a few stars, the biggest host entire clusters of galaxies. Over cosmic…
Structured optimization uses a prescribed set of atoms to assemble a solution that fits a model to data. Polarity, which extends the familiar notion of orthogonality from linear sets to general convex sets, plays a special role in a simple…
With the recent popularity of graphical clustering methods, there has been an increased focus on the information between samples. We show how learning cluster structure using edge features naturally and simultaneously determines the most…
Common meadows are commutative and associative algebraic structures with two operations (addition and multiplication) with additive and multiplicative identities and for which inverses are total. The inverse of zero is an error term…
In this paper we define 3-crossed modules for commutative (Lie) algebras and investigate the relation between this construction and the simplicial algebras. Also we define the projective 3-crossed resolution for investigate a higher…
Root systems are sets with remarkable symmetries and therefore they appear in many situations in mathematics. Among others, denominator formulae of root systems are very beautiful and mysterious equations which have several meanings from a…
The description of complex configuration is a difficult issue. We present a powerful technique for cluster identification and characterization. The scheme is designed to treat with and analyze the experimental and/or simulation data from…
We consider the rooted trees which not have isomorphic representation and introduce a conception of complexity a natural number also. The connection between quantity such trees with $n$ edges and a complexity of natural number $n$ is…
We investigate the collapsibility of systolic finite simplicial complexes of arbitrary dimension. The main tool we use in the proof is discrete Morse theory. We shall consider a convex subcomplex of the complex and project any simplex of…