Related papers: Circuits and circulant minors
We prove that this formula characterizes the square matrices over commutative rings for which all 2 x 2 minors equal zero.
For a directed acyclic graph, there are two known criteria to decide whether any specific conditional independence statement is implied for all distributions factorized according to the given graph. Both criteria are based on special types…
Let G be the circulant graph C_n(S) with S a subset of {1,2,...,\lfloor n/2 \rfloor}, and let I(G) denote its the edge ideal in the ring R = k[x_1,...,x_n]. We consider the problem of determining when G is Cohen-Macaulay, i.e, R/I(G) is a…
A nonnegative matrix A is said to be strongly robust if its max-algebraic eigencone is universally reachable, i.e., if the orbit of any initial vector ends up with a max-algebraic eigenvector of A. Consider the case when the initial vector…
We study the set covering polyhedron related to circulant matrices. In particular, our goal is to characterize the first Chv\'atal closure of the usual fractional relaxation. We present a family of valid inequalities that generalizes the…
In this paper we further our understanding of the structure of class two cubic graphs, or snarks, as they are commonly known. We do this by investigating their 3-critical subgraphs, or as we will call them, minimal conflicting subgraphs. We…
The family of cycle completable graphs has several cryptomorphic descriptions, the equivalence of which has heretofore been proven by a laborious implication-cycle that detours through a motivating matrix completion problem. We give a…
Miniaturization of devices inculcates the need for small-sized actuators. Actuators in the size of a few centimeters are not uncommon but miniature devices need ones that are less than a few centimeters in dimension. Market for such…
The purpose of this paper is to characterize graphs that do not have a large $K_{2,n}$-minor. As corollaries, it is proved that, for any given positive integer $n$, every sufficiently large 3-connected graph with minimum degree at least…
In this paper, we first give a new result characterizing the strongly connected digraphs with a diameter equal to that of their line digraphs. Then, we introduce the concepts of the inner diameter and inner radius of a digraph and study…
Metacirculants are a basic and well-studied family of vertex-transitive graphs, and weak metacirculants are generalizations of them. A graph is called a weak metacirculant if it has a vertex-transitive metacyclic automorphism group. This…
An 'arithmetic circuit' is a labeled, acyclic directed graph specifying a sequence of arithmetic and logical operations to be performed on sets of natural numbers. Arithmetic circuits can also be viewed as the elements of the smallest…
Let $\mathcal{M}$ be a square matrix over a commutative ring and let $\mathcal{A}$ be a principal submatrix. We give relations between the determinants of $\mathcal{M}$ and $\mathcal{A}$ based on an annihilating polynomial for one of them.…
A matrix is called a P-matrix if all its principal minors are positive. P-matrices have found important applications in functional analysis, mathematical programming, and dynamical systems theory. We introduce a new class of real matrices…
Dawar and Wilsenach (ICALP 2020) introduce the model of symmetric arithmetic circuits and show an exponential separation between the sizes of symmetric circuits for computing the determinant and the permanent. The symmetry restriction is…
Let R be a commutative ring with identity and M be an R-module. A proper ideal I of R is said to be a $z^\circ$-ideal if for each $a \in I$ the intersection of all minimal prime ideals containing a is contained in I. The purpose of this…
We study minimal sets on continua $X$ with a dense free interval $J$ and a locally connected remainder. This class of continua includes important spaces such as the topologist's sine curve or the Warsaw circle. In the case when minimal sets…
We study properties and applications of various circuit imbalance measures associated with linear spaces. These measures describe possible ratios between nonzero entries of support-minimal nonzero vectors of the space. The fractional…
This paper discusses a more general contractive condition for a class of extended cyclic self-mappings on the union of a finite number of subsets of a metric space which are allowed to have a finite number of successive images in the same…
In this paper, we give an important isomorphism between contacyclic codes and cyclic codes over finite principal ideal rings. Necessary and sufficient conditions for the existence of non-trivial cyclic self-dual codes over finite principal…