English
Related papers

Related papers: Properties of Commutative Association Schemes deri…

200 papers

The use of ensemble methods to solve inverse problems is attractive because it is a derivative-free methodology which is also well-adapted to parallelization. In its basic iterative form the method produces an ensemble of solutions which…

Numerical Analysis · Mathematics 2018-05-09 Neil K. Chada , Marco A. Iglesias , Lassi Roininen , Andrew M. Stuart

Primary decomposition of commutative monoid congruences is insensitive to certain features of primary decomposition in commutative rings. These features are captured by the more refined theory of mesoprimary decomposition of congruences,…

Commutative Algebra · Mathematics 2015-09-11 Thomas Kahle , Ezra Miller

In this paper we extend the idea of integration to generic algebras. In particular we concentrate over a class of algebras, that we will call self-conjugated, having the property of possessing equivalent right and left multiplication…

High Energy Physics - Theory · Physics 2016-11-23 Roberto Casalbuoni

Let $\mathbb{F}$ be any field. The Grassmannian $\mathrm{Gr}(m,n)$ is the set of $m$-dimensional subspaces in $\mathbb{F}^n$, and the general linear group $\mathrm{GL}_n(\mathbb{F})$ acts transitively on it. The Schubert cells of…

Combinatorics · Mathematics 2017-11-20 Yuta Watanabe

In this paper, we define and study (co)homology theories of a compatible associative algebra $A$. At first, we construct a new graded Lie algebra whose Maurer-Cartan elements are given by compatible associative structures. Then we define…

Rings and Algebras · Mathematics 2021-07-21 Taoufik Chtioui , Apurba Das , Sami Mabrouk

Complement-reducible graphs (or cographs) are the graphs formed from the single-vertex graph by the operations of complement and disjoint union. By combining the Johnson-Newman theorem on generalized cospectrality with the standard tools in…

Combinatorics · Mathematics 2025-07-23 Wei Wang , Ximei Huang

P-algebras are a non-commutative, non-associative generalization of Boolean algebras that are for quantum logic what Boolean algebras are for classical logic. P-algebras have type <X, 0, ', .> where 0 is a constant, ' is unary and . is…

Quantum Physics · Physics 2024-08-16 Daniel Lehmann

In this work we define, analyze, and compare different numerical schemes that can be used to study the ground state properties of Bose-Fermi systems, such as mixtures of different atomic species under external forces or self-bound quantum…

Computational Engineering, Finance, and Science · Computer Science 2025-10-22 Tomasz Świsłocki , Krzysztof Gawryluk , Mirosław Brewczyk , Tomasz Karpiuk

Terwilliger algebras are a subalgebra of a matrix algebra that are constructed from association schemes over finite sets. In 2010, Rie Tanaka defined what it means for a Terwilliger algebra to be almost commutative. In that paper she gave…

Representation Theory · Mathematics 2024-09-17 Nicholas L. Bastian , Stephen P. Humphries

This paper offers a review of recent studies on the entanglement of free-fermion systems on graphs that take advantage of methods pertaining to signal processing and algebraic combinatorics. On the one hand, a parallel with time and band…

Quantum Physics · Physics 2024-06-13 Pierre-Antoine Bernard , Nicolas Crampé , Rafael I. Nepomechie , Gilles Parez , Luc Vinet

With the growing size of data sets, feature selection becomes increasingly important. Taking interactions of original features into consideration will lead to extremely high dimension, especially when the features are categorical and…

Databases · Computer Science 2021-04-13 Qiuqiang Lin , Chuanhou Gao

Poisson algebra is usually defined to be a commutative algebra together with a Lie bracket, and these operations are required to satisfy the Leibniz rule. We describe Poisson structures in terms of a single bilinear operation. This enables…

Rings and Algebras · Mathematics 2007-09-04 Michel Goze , Elisabeth Remm

We construct a pair of non-commutative rank 8 association schemes from a rank 3 non-symmetric association scheme. For the pair, two association schemes have the same character table but different Frobenius-Schur indicators. This situation…

Combinatorics · Mathematics 2021-09-06 Akihide Hanaki , Masayoshi Yoshikawa

Obtaining a rigorous and reliable method for linking computer simulations of polymer blends and composites at different length scales of interest is a highly desirable goal in soft matter physics. In this paper a multiscale modeling…

Soft Condensed Matter · Physics 2015-05-19 J. McCarty , M. G. Guenza

In this paper, we discuss characteristic polynomials in (Clifford) geometric algebras ${\mathcal {G}}_{p,q}$ of vector space of dimension $n=p+q$. We present basis-free formulas for all characteristic polynomial coefficients in the cases…

Mathematical Physics · Physics 2022-09-13 K. S. Abdulkhaev , D. S. Shirokov

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…

Quantum Algebra · Mathematics 2007-05-23 Alexander Odesskii , Vladimir Sokolov

In this expositional paper, we discuss commutative algebra -- a study inspired by the properties of integers, rational numbers, and real numbers. In particular, we investigate rings and ideals, and their various properties. After, we…

Algebraic Geometry · Mathematics 2021-10-19 Marc Maliar

We give a complete description of the irreducible representations of algebraic fusions of association schemes, in terms of the irreducible representations of a Schur cover of the corresponding group of algebraic automorphisms.

Combinatorics · Mathematics 2015-07-28 Daniel Kalmanovich , Eli Shamovich

A compatible associative algebra is a vector space endowed with two associative multiplication operations that satisfy a natural compatibility condition. In this paper, we investigate and classify compatible pairs of associative algebras of…

Rings and Algebras · Mathematics 2025-05-12 Ahmed Zahari Abdou Damdji , Bouzid Mosbahi

Affordances are fundamental descriptors of relationships between actions, objects and effects. They provide the means whereby a robot can predict effects, recognize actions, select objects and plan its behavior according to desired goals.…

Robotics · Computer Science 2024-02-12 Pedro Osório , Alexandre Bernardino , Ruben Martinez-Cantin , José Santos-Victor