Related papers: On structures induced by the power sequences of $(…
We present an algebraic structure in modules over integer rings with cardinality prime powers, which allows to define bases. With such structure, we prove a similar version for the basis extension theorem of linear algebra over fields.…
In this paper we propose an algebraic formalization of connectors in the quantitative setting, in order to address their non-functional features in architectures of component-based systems. We firstly present a weighted Algebra of…
On the basis of the Lorentz equations of motion, the orbit of a charge driven by a generic E.M. field with planar symmetry is formulated and analyzed within the framework of a Lorentzian geometry with a curvature whose order of magnitude is…
The power graph of a group is the graph whose vertex set is the set of non-trivial elements of group, two elements being adjacent if one is a power of the other. We define a new power graph and study on connectivity, diameter and clique…
Let $K$ be a field of characteristic $p>0$, $A=K[[Y]]$ be a power series ring in one variable and $Q(A)$ be the field of fraction of $A$. Suppose that $R=A[X_1,\ldots,X_n]$ is a standard $\mathbb{N}^n$-graded polynomial ring over $A$, i.e.,…
Strongly interacting models often possess "dualities" subtler than a one-to-one mapping of energy levels. The maps can be non-invertible, as apparent in the canonical example of Kramers and Wannier. We analyse an algebraic structure common…
[[ RM: A review paper on cycle expansions. I quote the introduction: in section (2) ]] I will summarize Gutzwiller's theory for the spectrum of eigenenergies and extend it to diagonal matrix elements as well. The derivation of the…
This article presents a study of an algebra spanned by the faces of a hyperplane arrangement. The quiver with relations of the algebra is computed and the algebra is shown to be a Koszul algebra. It is shown that the algebra depends only on…
The set of discrete lattice paths from (0, 0) to (n, n) with North and East steps (i.e. words w $\in$ { x, y } * such that |w| x = |w| y = n) has a canonical monoid structure inherited from the bijection with the set of join-continuous maps…
The paper describes the algebraic structure of the graded algebra of differentially homogeneous polynomials of fixed finite order. We show that it is a finitely generated algebra, and we exhibit a minimal set of generators. Along the way,…
Let $M \in M_n (\mathbb Z)$ denote any matrix. Thinking of $M$ as a linear map $M:{\mathbb Z}^n \to {\mathbb Z}^n$, we denote by ${\Image}(M)$ the $\mathbb Z$-span of the column vectors of $M$. Let $e_1, ..., e_n,$ denote the standard basis…
There has been a great deal of attention recently to graphs whose vertex set is a group, defined using the group structure. (The commuting graph, where two elements are joined if they commute, is the oldest and most famous example.) The…
Let $p$ be a prime. We study the structure of and the inclusion relations among the terms in the monomial lattice in the modular symmetric power representations of $\mathrm{GL}_2(\mathbb{F}_p)$. We also determine the structure of certain…
Orthogonal sets of idempotents are used to design sets of unitary matrices, known as constellations, such that the modulus of the determinant of the difference of any two distinct elements is greater than $0$. It is shown that unitary…
In this note, we provide some results concerning the structure of a set $A\subseteq \mathbb{Z}_n^{\times}$, which has non-empty subset sums equally distributed modulo $n$. Here, $\mathbb{Z}_n^{\times}$ denotes the set which contains all the…
Questions that seek to determine whether a hyperplane arrangement property, be it geometric, arithmetic or topological, is of a combinatorial nature (that is determined by the intersection lattice) are abundant in the literature. To tackle…
The enhanced power graph $\mathcal{P}_E(G)$ of a finite group $G$ is the simple undirected graph whose vertex set is $G$ and two distinct vertices $x, y$ are adjacent if $x, y \in \langle z \rangle$ for some $z \in G$. In this article, we…
A lattice $L$ is said lowly finite if the set $[\mathsf{0},a]$ is finite for every element $a$ of $L$. We mainly aim to provide a complete proof that, if $M$ is a subset of a complete lowly finite distributive lattice $L$ containing its…
We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and…
We consider quantum graphs with spin-orbit couplings at the vertices. Time-reversal invariance implies that the bond S-matrix is in the orthogonal or symplectic symmetry class, depending on spin quantum number s being integer or…