Related papers: Graphical cyclic supercharacters for composite mod…
In an interesting paper Professor Cunsheng Ding provided three constructions of cyclic codes of length being a product of two primes. Numerical data shows that many codes from these constructions are best cyclic codes of the same length and…
Graph density profiles are fundamental objects in extremal combinatorics. Very few profiles are fully known, and all are two-dimensional. We show that even in high dimensions ratios of graph densities and numbers often form the power-sum…
Every mathematician is familiar with the beautiful structure of finite commutative groups. What is less well known is that finite commutative semigroups also have a neat and well-described structure. We prove this in an efficient fashion.…
A unified description of spacetime and matter at the Planck scale is proposed by using the irreducible representation of N=10 extended Super-Poincar\'e algebra, where all matters and all forces except the graviton are the supersymmetric…
Graphic statics is undergoing a renaissance, with computerized visual representation becoming both easier and more spectacular as time passes. While methods of the past are revived and tweaked, little emphasis has been placed on studying…
We present the results of systematic numerical computations relating to the extreme value statistics of the characteristic polynomials of random unitary matrices drawn from the Circular Unitary Ensemble (CUE) of Random Matrix Theory. In…
This paper studies eight families of infinite series involving hyperbolic functions. Under some conditions, these series are linear combinations of derivatives of Eisenstein series. The paper gives a systematic method for computing the…
The structure of the moduli space of N=1 supersymmetric gauge theories is analyzed from an algebraic geometric viewpoint. The connection between the fundamental fields of the ultraviolet theory, and the gauge invariant composite fields of…
We consider Cayley sum graphs over the cyclic group $\mathbb{Z}_n$ and aim to explore several necessary and sufficient conditions for the existence of total perfect codes in these graphs. Specifically, we examine various cases for the…
Circulant graphs are an important class of interconnection networks in parallel and distributed computing. Integral circulant graphs play an important role in modeling quantum spin networks supporting the perfect state transfer as well. The…
Being motivated in terms of mathematical concepts from the theory of electrical networks, Klein & Ivanciuc introduced and studied a new graph-theoretic cyclicity index--the global cyclicity index (Graph cyclicity, excess conductance, and…
We define the superclasses for a classical finite unipotent group $U$ of type $B_{n}(q)$, $C_{n}(q)$, or $D_{n}(q)$, and show that, together with the supercharacters defined in a previous paper, they form a supercharacter theory. In…
We classify the simple modules of the exceptional algebraic supergroups over an algebraically closed field of prime characteristic.
K\H{o}nig's edge-coloring theorem for bipartite graphs and Vizing's edge-coloring theorem for general graphs are celebrated results in graph theory and combinatorial optimization. Schrijver generalized K\H{o}nig's theorem to a framework…
Within the supertwistor approach, we analyse the superconformal structure of 4D N = 2 compactified harmonic/projective superspace. In the case of 5D superconformal symmetry, we derive the superconformal Killing vectors and related building…
We establish new estimates on short character sums for arbitrary composite moduli with small prime factors. Our main result improves on the Graham-Ringrose bound for square free moduli and also on the result due to Gallagher and Iwaniec…
The characters of the unitarizable highest weight modules over the N=2 superconformal algebras are presented. This is a slightly extended version of an Encyclopedia entry.
We give a simple matrix-based proof of congruence equations modulo a prime $p$ involving sums of binomial coefficients appearing in Pascal's triangle. These equations can be used to construct some groups of exponent $p^n$. These groups, as…
Motivated by Stanley's generalization of the chromatic polynomial of a graph to the chromatic symmetric function, we introduce the characteristic polynomial of a representation of the symmetric group, or more generally, of a symmetric…
Polar commutative n-complex numbers of the form u=x_0+h_1x_1+h_2x_2+...+h_{n-1}x_{n-1} are introduced in n dimensions, the variables x_0,...,x_{n-1} being real numbers. The polar n-complex number can be represented, in an even number of…