Related papers: Balancing permuted copies of multigraphs and integ…
Persymmetric Jacobi matrices are invariant under reflection with respect to the anti-diagonal. The associated orthogonal polynomials have distinctive properties that are discussed. They are found in particular to be also orthogonal on the…
Sums-of-squares formulas over the integers have been studied extensively using their equivalence to consistently signed intercalate matrices. This representation, combined with combinatorial arguments, has been used to produce…
Jerrum, Sinclair and Vigoda (2004) showed that the permanent of any square matrix can be estimated in polynomial time. This computation can be viewed as approximating the partition function of edge-weighted matchings in a bipartite graph.…
The monography considers the problem of constructing a Hamiltonian cycle in a complete graph. A rule for constructing a Hamiltonian cycle based on isometric cycles of a graph is established. An algorithm for constructing a Hamiltonian cycle…
This paper deals with lattice congruences of the weak order on the symmetric group, and initiates the investigation of the cover graphs of the corresponding lattice quotients. These graphs also arise as the skeleta of the so-called…
We consider a dynamical system on a metric graph, that corresponds to a semiclassical solution of a time-dependent Schr\"odinger equation. We omit all details concerning mathematical physics and work with a purely discrete problem. We find…
This article provides a method for constructing invariants and semi-invariants of a binary $N$-ic form over a field $k$ characteristics $0$ or $p > N$. A practical and broadly applicable sufficient condition for ensuring nontriviality of…
We investigate numerically efficient approximations of eigenspaces associated to symmetric and general matrices. The eigenspaces are factored into a fixed number of fundamental components that can be efficiently manipulated (we consider…
On the math-fun mailing list (7 May 2013), Neil Sloane asked to calculate the number of $n \times n$ matrices with entries in $\{0,1\}$ which are squares of other such matrices. In this paper we analyze the case that the arithmetic is in…
A matching $M$ in a graph $\Gamma$ is positive if $\Gamma$ has a vertex-labeling such that $M$ coincides with the set of edges with positive weights. A positive matching decomposition (pmd) of $\Gamma$ is an edge-partition $M_1,\ldots,M_p$…
Let $\mathbb{K}$ be a finite commutative ring, and let $\mathbb{L}$ be a commutative $\mathbb{K}$-algebra. Let $A$ and $B$ be two $n \times n$-matrices over $\mathbb{L}$ that have the same characteristic polynomial. The main result of this…
Let $\mathbf{k}$ be an algebraically closed field. Recently, K. Erdmann classified the symmetric $\mathbf{k}$-algebras $\Lambda$ of finite representation type such that every non-projective module $M$ has period dividing four. The goal of…
Let $Q$ be a finite quiver of Dynkin type and $\Lambda=\Lambda_Q$ be the preprojective algebra of $Q$ over an algebraically closed field $k$. Let $\mathcal {T}_\Lambda$ be the mutation graph of maximal rigid $\Lambda$ modules. Geiss,…
In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…
Problems related to graph matching and isomorphisms are very important both from a theoretical and practical perspective, with applications ranging from image and video analysis to biological and biomedical problems. The graph matching…
The moduli space and generalised global symmetries of 3d $\mathcal{N} = 5$ superconformal field theories are investigated, with a focus on the orthosymplectic ABJ theories and their discrete gauging variants. We extend the known…
For a fixed positive integer n, let S_n denote the symmetric group of n! permutations on n symbols, and let maj(sigma) denote the major index of a permutation sigma. For positive integers k<m not greater than n and non-negative integers i…
The spectra of signed matrices have played a fundamental role in social sciences, graph theory, and control theory. In this work, we investigate the computational problems of identifying symmetric signings of matrices with natural spectral…
In this note we construct a solution of a matrix interval linear equation of the form X=AX+B (the discrete stationary Bellman equation) over partially ordered semirings, including the semiring of nonnegative real numbers and all idempotent…
In this monograph we undertake a comprehensive study of separable representations (as well as their unitary equivalence classes) of $C^*$-algebras associated to strongly connected finite $k$-graphs $\Lambda$. We begin with the…