Search
Search Results
-
Approximation algorithms for sorting by k-cuts on signed permutations
Sorting by Genome Rearrangements is a classic problem in Computational Biology. Several models have been considered so far, each of them defines how...
-
Counting and signed counting permutations by descent-based statistics
The original motivation of this paper was to find the context-free grammar for the joint distribution of peaks and valleys on permutations. Although...
-
Fragmenting any Parallelepiped into a Signed Tiling
It is broadly known that any parallelepiped tiles space by translating copies of itself along its edges. In earlier work relating to...
-
Signed rearrangement distances considering repeated genes, intergenic regions, and indels
Genome rearrangement distance problems allow to estimate the evolutionary distance between genomes. These problems aim to compute the minimum number...
-
Sorting by k-Cuts on Signed Permutations
Sorting by Genome Rearrangements is a classic problem in Computational Biology. Several models have been considered so far, each of them defines how...
-
-
Quadratic differentials and signed measures
In this paper, motivated by the classical notion of a Strebel quadratic differential on a compact Riemann surface without boundary, we introduce...
-
-
-
Signed graphs with at most three eigenvalues
We investigate signed graphs with just 2 or 3 distinct eigenvalues, mostly in the context of vertex-deleted subgraphs, the join of two signed graphs...
-
Construction of cospectral graphs, signed graphs and \({\mathbb {T}}\)-gain graphs via partial transpose
In the wake of Dutta and Adhikari, who in 2020 used partial transposition in order to get pairs of cospectral graphs, we investigate partial...
-
The Structure Group and the Permutation Group of a Set-Theoretic Solution of the Quantum Yang–Baxter Equation
We describe the left brace structure of the structure group and the permutation group associated with an involutive, non-degenerate set-theoretic...
-
Algorithms and Complexity of Signed, Minus, and Majority Domination
A signed dominating function on a graph G = (V, E) is a function f : V →{−1, 1} satisfying the condition that for every vertex v ∈ V , the sum of the...
-
Permutation Matrices, Their Discrete Derivatives and Extremal Properties
For a permutation π , and the corresponding permutation matrix, we introduce the notion of discrete derivative , obtained by taking differences of...
-
Fluctuation Moments Induced by Conjugation with Asymptotically Liberating Random Matrix Ensembles
Independent Haar-unitary random matrices and independent Haar-orthogonal random matrices are known to be asymptotically liberating ensembles, and...
-
Main Eigenvalues of Real Symmetric Matrices with Application to Signed Graphs
An eigenvalue of a real symmetric matrix is called main if there is an associated eigenvector not orthogonal to the all-1 vector j. Main eigenvalues...
-
