相关论文: Dual equivalence graphs II: Transformations on loc…
We explore an identity between two branching graphs and propose a physical meaning in the context of the gauge-gravity correspondence. From the mathematical point of view, the identity equates probabilities associated with $\mathbb{GT}$,…
Characterizing derived equivalences between algebras via combinatorial structures has recently become a popular topic. In this paper, we study admissible fractional Brauer graph algebras, a new subclass of self-injective special biserial…
The paper concerns the automorphism groups of Cayley graphs over cyclic groups which have a rational spectrum (rational circulant graphs for short). With the aid of the techniques of Schur rings it is shown that the problem is equivalent to…
Theoretical equivalence and duality are two closely related notions: but their interconnection has so far not been well understood. In this paper I explicate the contribution of a recent schema for duality to discussions of theoretical…
Connectedness and bipartiteness are basic properties of classical graphs, and the purpose of this paper is to investigate the case of quantum graphs. We introduce the notion of connectedness and bipartiteness of quantum graphs in terms of…
A quasisymmetric function is assigned to every double poset (that is, every finite set endowed with two partial orders) and any weight function on its ground set. This generalizes well-known objects such as monomial and fundamental…
This thesis investigates quantum cloning and related quantum entanglement problems using core concepts of representation theory, in particular those associated with the symmetric group. The research explores Schur-Weyl duality and its…
Given a hypergraph $\mathcal{H}$, the dual hypergraph of $\mathcal{H}$ is the hypergraph of all minimal transversals of $\mathcal{H}$. The dual hypergraph is always Sperner, that is, no hyperedge contains another. A special case of Sperner…
Linear complementarity problems provide a powerful framework to model nonsmooth phenomena in a variety of real-world applications. In dynamical control systems, they appear coupled to a linear input-output system in the form of linear…
A 2-switch is an edge addition/deletion operation that changes adjacencies in the graph while preserving the degree of each vertex. A well known result states that graphs with the same degree sequence may be changed into each other via…
A graph of order $n>3$ is called {switching separable} if its modulo-2 sum with some complete bipartite graph on the same set of vertices is divided into two mutually independent subgraphs, each having at least two vertices. We prove the…
We describe a combinatorial formula for the coefficients when the dual immaculate quasisymmetric functions are decomposed into Young quasisymmetric Schur functions. We prove this using an analogue of Schensted insertion. Using this result,…
We define and study a new class of bialgebras, which generalize certain Turner double algebras related to generic blocks of symmetric groups. Bases and generators of these algebras are given. We investigate when the algebras are symmetric,…
We observe that for planar graphs, the geometric duality relation generates both 2-isomorphism and abstract duality. This observation has the surprising consequence that for links, the equivalence relation defined by isomorphisms of…
In a graph $\Gamma=(V,E)$, we consider the common closed neighbourhood of a subset of vertices and use this notion to introduce a Moore closure operator in $V.$ We also consider the closed twin equivalence relation in which two vertices are…
In digital signal processing, shift-invariant filters can be represented as a polynomial expansion of a shift operation,that is, the Z-transform representation. When extended to graph signal processing (GSP), this would mean that a…
We study lines through the origin of finite-dimensional complex vector spaces that enjoy a doubly transitive automorphism group. This paper classifies those lines that exhibit almost simple symmetries. We introduce a general recipe…
In this article, we extend several algebraic graph analysis methods to bipartite networks. In various areas of science, engineering and commerce, many types of information can be represented as networks, and thus the discipline of network…
In this paper the double-sided Taylor's approximations are studied. A short proof of a well-known theorem on the double-sided Taylor's approximations is introduced. Also, two new theorems are proved regarding the monotonicity of such…
In this paper we shall be looking at several results relating Schur rings to sufficient conditions for a graph to be a graphical regular representation (GRR) of a finite group, and then applying these specifically in the case of certain…