Related papers: Computing the alpha complex using dual active set …
We consider the construction of the fundamental function and Abelian differentials of the third kind on a plane algebraic curve over the field of complex numbers that has no singular points. The algorithm for constructing differentials of…
Subspace clustering is the problem of clustering data that lie close to a union of linear subspaces. In the abstract form of the problem, where no noise or other corruptions are present, the data are assumed to lie in general position…
Graded rings provide a natural algebraic framework for encoding symmetry via decompositions into homogeneous components indexed by a group, together with multiplication rules reflecting the group operation. Among graded rings, strongly…
This paper focuses on the derivations and automorphism groups of certain finite-dimensional associative algebras over the field of complex numbers. Using classification results for algebras of dimensions two, three, and four, along with…
Let $\Omega$ be a bounded domain of $\mathbb{R}^3$ whose closure $\overline{\Omega}$ is polyhedral, and let $\mathcal{T}$ be a triangulation of $\overline{\Omega}$. Assuming that the boundary of $\Omega$ is sufficiently regular, we provide…
An algorithm is presented allowing the construction of fast Fourier transforms for any solvable group on a classical computer. The special structure of the recursion formula being the core of this algorithm makes it a good starting point to…
In representation theory, the double centraliser property is an important property for a module (bimodule). It plays a fundamental role in many theories. In this paper, we extend this property to complexes in derived categories of finite…
In this paper we present some linear algebra behind quadratic parts of quadratically flat complex points of codimension two real submanifold in a complex manifold. Assuming some extra nondegenericity and using the result of Hong, complete…
Inspired by the ideas and techniques used in the study of cluster algebras we construct a new class of algebras, called bistellar cluster algebras, from closed oriented triangulated even-dimensional manifolds by performing…
We construct a cochain map embedding the cohomology complex of any dual Leibniz algebra $B$ into the Lie algebra cochain complex of $\mathfrak{g} \otimes B$, where $\mathfrak{g}$ is a Leibniz algebra. This reduces the study of dual Leibniz…
Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…
We establish a formula for the weight multiplicities of Demazure modules (in particular for highest weight representations) of a complex connected algebraic group in terms of the geometry of its Langlands dual.
We study associative multiplications in semi-simple associative algebras over C compatible with the usual one or, in other words, linear deformations of semi-simple associative algebras over C. It turns out that these deformations are in…
Inspired by a work of Kapranov, we define the notion of Dolbeault complex of the formal neighborhood of a closed embedding of complex manifolds. This construction allows us to study coherent sheaves over the formal neighborhood via complex…
A bi-Hamiltonian formulation is proposed for triangular systems resulted by perturbations around solutions, from which infinitely many symmetries and conserved functionals of triangular systems can be explicitly constructed, provided that…
Symmetry plays a central role in accelerating symbolic computation involving polynomials. This chapter surveys recent developments and foundational methods that leverage the inherent symmetries of polynomial systems to reduce complexity,…
Given a polynomial system f, a fundamental question is to determine if f has real roots. Many algorithms involving the use of infinitesimal deformations have been proposed to answer this question. In this article, we transform an approach…
The 'exact subgraph' approach was recently introduced as a hierarchical scheme to get increasingly tight semidefinite programming relaxations of several NP-hard graph optimization problems. Solving these relaxations is a computational…
To a complex symplectic manifold X we associate a canonical quantization algebroid. Our construction is similar to that of Polesello-Schapira's deformation-quantization algebroid, but the deformation parameter is no longer central. If X is…
We introduce a new algorithm for the structural analysis of finite abstract simplicial complexes based on local homology. Through an iterative and top-down procedure, our algorithm computes a stratification $\pi$ of the poset $P$ of…