Related papers: Cayley's hyperdeterminant: a combinatorial approac…
A Cayley hyper-digraph is a directed hypergraph that its automorphism group contains a subgroup acting regularly on vertices and a Cayley hypermap is a hypermap whose automorphism group contains a subgroup which induces regular action on…
In this paper, the Boiti Leon Pempinelli system in (2+1)-dimensions is revisited for Lie symmetries and invariant solutions. An infinite-dimensional Lie algebra is obtained using the Lie invariance criterion and is further classified into…
We produce a new family of polynomials f(x) over fields K of characteristic 2 which are exceptional, in the sense that f(x)-f(y) has no absolutely irreducible factors in K[x,y] besides the scalar multiples of x-y; when K is finite, this…
We give a complete formula for the characteristic polynomial of hyperplane arrangements $\mathcal J_n$ consisting of the hyperplanes $x_i+x_j=1$, $x_k=0$, $x_l=1$, $ 1\leq i, j, k, l\leq n$. The formula is obtained by associating hyperplane…
We investigate the representation of symmetric polynomials as a sum of squares. Since this task is solved using semidefinite programming tools we explore the geometric, algebraic, and computational implications of the presence of discrete…
A positive integer $n$ is a Cayley number if every vertex-transitive graph of order $n$ is a Cayley graph. In 1983, Dragan Maru\v{s}i\v{c} posed the problem of determining the Cayley numbers. In this paper we give an infinite set $S$ of…
Let $K$ be a global field of characteristic different from 2 and $u(x)\in K[x]$ be an irreducible polynomial of even degree $2g\ge 6$, whose Galois group over $K$ is either the full symmetric group $S_{2g}$ or the alternating group…
This paper proves that the characteristic polynomial is a complete unitary invariant for pairs of projection matrices. Some special cases involving three or more projections are also considered.
A conjecture of Kac now a theorem asserts that the polynomial now known as the Kac polynomial, which counts the isomorphism classes of absolutely indecomposable representations of a quiver over a finite field with a given dimension vector,…
The degree-diameter problem seeks to find the largest possible number of vertices in a graph having given diameter and given maximum degree. Very often the problem is studied for restricted families of graph such as vertex-transitive or…
We consider the five-vertex model on a finite square lattice with fixed boundary conditions such that the configurations of the model are in a one-to-one correspondence with the boxed plane partitions (3D Young diagrams which fit into a box…
We use some basic properties of binomial and Stirling numbers to prove that the Euler characteristic is, essentially, the unique numerical topological invariant for compact polyhedra which can be expressed as a linear combination of the…
A polynomial transform is the multiplication of an input vector $x\in\C^n$ by a matrix $\PT_{b,\alpha}\in\C^{n\times n},$ whose $(k,\ell)$-th element is defined as $p_\ell(\alpha_k)$ for polynomials $p_\ell(x)\in\C[x]$ from a list…
A new procedure for the construction of higher-dimensional Lie-Hamilton systems is proposed. This method is based on techniques belonging to the representation theory of Lie algebras and their realization by vector fields. The notion of…
In this note we give concise formulas, which lead to a simple and fast computer program that computes a powerful knot invariant. This invariant $\rho_1$ is not new, yet our formulas are by far the simplest and fastest: given a knot we write…
In this paper, we classify solvable Lie algebras of dimensions $\leq 8$ endowed with a nondegenerate invariant symmetric bilinear form over an algebraically closed field. This classification (up to isometrically isomorphisms) is mainly…
We present a conjecture for expressing the coefficients in the Cayley-Hamilton theorem for supermatrices in terms of supertraces. The conjecture is tested for several supermatrix dimensions and unique results are obtained. Generating…
There is a digraph corresponding to every square matrix over $\mathbb{C}$. We generate a recurrence relation using the Laplace expansion to calculate the characteristic, and permanent polynomials of a square matrix. Solving this recurrence…
Cayley's formula is a fundamental result in combinatorics that counts the number of labeled trees on n vertices. While existing proofs use approaches such as Prufer sequences and the Matrix-Tree Theorem, we give a combinatorial proof that…
Bounded holomorphic interpolation problems associated to finitely many data have, in general, distinct solutions. Uniqueness arises only in some convex extreme configurations. Rational inner functions in a polydisk are the best understood…