Related papers: BCK-algebras arising from block codes
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
Using a clear and straightforward approach, we discover and prove new binary digit extraction BBP-type formulas for polylogarithm constants. Some known results are also rediscovered in a more direct and elegant manner. Numerous…
This work is meant to demonstrate new class of prime numbers -- cyclic prime numbers, that can be derived from any prime number at certain numeric systems. Cyclic prime numbers are also related to the cyclic numbers and full reptend prime…
We construct new solvable vertex models based on the spin representation of the Lie algebra $B_k$. We use these models to study the algebraic structure underlying such vertex theories. We show that all the $B_k$ spin vertex models obey a…
Given finitely many consecutive terms of an infinite sequence, we discuss the construction of a polynomial difference equation that the sequence may satisfy. We also present a method to seek a candidate polynomial differential equation for…
An algebraic deformation theory of coalgebra morphisms is constructed.
We address the problem of enumerating all maximal clique-partitions of an undirected graph and present an algorithm based on the observation that every maximal clique-partition can be produced from the maximal clique-cover of the graph by…
We describe an algorithm for listing all elements of bounded height in a given number field.
Rook polynomials are a powerful tool in the theory of restricted permutations. It is known that the rook polynomial of any board can be computed recursively, using a cell decomposition technique of Riordan. In this paper, we give a new…
There is a large class of problems in algebraic combinatorics which can be distilled into the same challenge: construct an explicit combinatorial bijection. Traditionally, researchers have solved challenges like these by visually inspecting…
We provide a novel family of generative block-models for random graphs that naturally incorporates degree distributions: the block-constrained configuration model. Block-constrained configuration models build on the generalised…
We introduce a new method of expressing a $k$-graph $C^*$-algebra as a Cuntz-Pimsner algebra. Kumjian, Pask, and Sims have done this directly, using a linking algebra approach and a $(k-1)$-graph algebra. This can be iterated downward. Our…
We give several algorithms addressing computations of intersections of conjugate subgroups.
Let $A$ be the path algebra of a finite acyclic quiver $Q$ over a finite field. We realize the quantum cluster algebra with principal coefficients associated to $Q$ as a sub-quotient of a certain Hall algebra involving the category of…
We give a method of constructing self-orthogonal codes from equitable partitions of association schemes. By applying this method we construct self-orthogonal codes from some distance-regular graphs. Some of the obtained codes are optimal.…
In this paper we present a method for extraction of arcs of the algebraic curves of the higher order. Method is applied on conics, Cartesian ovals, trifocal curves and generalized Weber's curve.
In this paper we deal with the Wedderburn b-decomposition for alternative baric algebras.
We classify tame block algebras of Hecke algebras of classical type over an algebraically closed field of odd characteristic.
The primary goal of this paper is to present a unified way to transform the syntax of a logic system into certain initial algebraic structure so that it can be studied algebraically. The algebraic structures which one may choose for this…
Any cluster-tilted algebra is the relation extension of a tilted algebra. We present a method to, given the distribution of a cluster-tilting object in the Auslander-Reiten quiver of the cluster category, construct all tilted algebras whose…