Related papers: Semi-invariants of binary forms and symmetrized gr…

In this paper we develop a theory for constructing an invariant of closed oriented 3-manifolds, given a certain type of Hopf algebra. Examples are given by a quantised enveloping algebra of a semisimple Lie algebra, or by a semisimple…

A symmetric quiver $(Q,\sigma)$ is a finite quiver without oriented cycles $Q=(Q_0,Q_1)$ equipped with a contravariant involution $\sigma$ on $Q_0\sqcup Q_1$. The involution allows us to define a nondegenerate bilinear form $<,>$ on a…

We study permutation-invariant quantum codes in the symmetric subspace $\mathrm{Sym}^n(\mathbb{C}^q) $ of $n$ qudits of local dimension $q$. For every integer $q\geq 2$, we construct a permutation-invariant code with parameters…

The use of permutation polynomials has appeared, along to their compositional inverses, as a good choice in the implementation of cryptographic systems. Hence, there has been a demand for constructions of these polynomials which…

We consider a Laplacian on periodic discrete graphs. Its spectrum consists of a finite number of bands. In a class of periodic 1-forms, i.e., functions defined on edges of the periodic graph, we introduce a subclass of minimal forms with a…

Suppose $G$ is a simple graph with $n$ vertices, $m$ edges, and rank $r$. Let $\chi_G(t)=a_0t^n-a_1t^{n-1}+\cdots +(-1)^ra_rt^{n-r}$ be the chromatic polynomial of $G$. For $q,k\in \Bbb{Z}$ and $0\le k\le q+r+1$, we obtain a sharp two-side…

Any directed graph G with N vertices and J edges has an associated line-graph L(G) where the J edges form the vertices of L(G). We show that the non-zero eigenvalues of the adjacency matrices are the same for all graphs of such a family…

Chromatic polynomials and related graph invariants are central objects in both graph theory and statistical physics. Computational difficulties, however, have so far restricted studies of such polynomials to graphs that were either very…

A partial automorphism of a semigroup $S$ is any isomorphism between its subsemigroups, and the set all partial automorphisms of $S$ with respect to composition is the inverse monoid called the partial automorphism monoid of $S$. Two…

In the presence of topologically nontrivial bosonic field configurations, the fermion number operator may take on fractional eigenvalues, because of the existence of zero-energy fermion modes. The simplest examples of this occur in 1+1…

Supersymmetry can be consistently generalized in one and two dimensional spaces, fractional supersymmetry being one of the possible extension. 2D fractional supersymmetry of arbitrary order $F$ is explicitly constructed using an adapted…

First, I introduce quantum graph theory. I also discuss a known lower bound on the independence numbers and derive from it an upper bound on the chromatic numbers of quantum graphs. Then, I construct a family of quantum graphs that can be…

One purpose of this proceedings-contribution is to show that at least for free massless particles it is possible to construct an explicit boson theory which is exactly equivalent in terms of momenta and energy to a fermion theory. The…

Higher genus partition functions of two-dimensional conformal field theories have to be invariants under linear actions of mapping class groups. We illustrate recent results [4,6] on the construction of such invariants by concrete…

We construct the non-minimal linear representations of the N=4 Extended Supersymmetry in one-dimension. They act on 8 bosonic and 8 fermionic fields. Inequivalent representations are specified by the mass-dimension of the fields and the…

We provide a general construction procedure for antilinearly invariant complex root spaces. The proposed method is generic and may be applied to any Weyl group allowing to take any element of the group as a starting point for the…

We demonstrate how a one parameter family of interacting non-commuting Hamiltonians, which are physically equivalent, can be constructed in non-commutative quantum mechanics. This construction is carried out exactly (to all orders in the…

The $k$-independence number of a graph is the maximum size of a set of vertices at pairwise distance greater than $k$. A graph is called $k$-partially walk-regular if the number of closed walks of a given length $l\le k$, rooted at a vertex…

We argue that fermion-boson mapping techniques represent a natural tool for studying many-body supersymmetry in fermionic systems with pairing. In particular, using the generalized Dyson mapping of a many-level fermion superalgebra with the…

Let $K$ be a field and let $\mathbb N = \{1,2, \dots \}$. Let $R_n=K[x_{ij} \mid 1\le i\le n, j\in \mathbb N]$ be the ring of polynomials in $x_{ij}$ $(1 \le i \le n, j \in \mathbb N)$ over $K$. Let $S_n = Sym (\{1,2, \ldots, n \})$ and…