Related papers: Finding an Integral vector in an Unknown Polyhedra…
For a given nonnegative matrix $A=(A_{ij})$, the matrix scaling problem asks whether $A$ can be scaled to a doubly stochastic matrix $D_1AD_2$ for some positive diagonal matrices $D_1,D_2$.The Sinkhorn algorithm is a simple iterative…
We give an elementary introduction to some recent polyhedral techniques for understanding and solving systems of multivariate polynomial equations. We provide numerous concrete examples and illustrations, and assume no background in…
For an $n \times n$ nonnegative matrix $P$, an isomorphism is obtained between the lattice of initial subsets (of ${1,...,n}$) for $P$ and the lattice of $P$-invariant faces of the nonnegative orthant $\IR^{n}_{+}$. Motivated by this…
We give a polynomial-time algorithm for detecting very long cycles in dense regular graphs. Specifically, we show that, given $\alpha \in (0,1)$, there exists a $c=c(\alpha)$ such that the following holds: there is a polynomial-time…
We consider a distance-regular graph $\Gamma=(X, \mathcal R)$ called the bilinear forms graph $H_q(D,N-D)$; we assume $N>2D\geq 6$ and $q \not=2$. We show that $\Gamma$ satisfies the following strengthened version of the balanced set…
The graph isomorphism (GI) problem, which asks whether two graphs are structurally identical, occupies a unique position in computational complexity -- it is neither known to be solvable in polynomial time, nor proven to be NP-complete. We…
The Fibonacci cube of dimension n, denoted as $\Gamma\_n$, is the subgraph of the hypercube induced by vertices with no consecutive 1's. The irregularity of a graph G is the sum of |d(x)-d(y)| over all edges {x,y} of G. In two recent paper…
We consider a planar graph $G$ in which the edges have nonnegative integer lengths such that the length of every cycle of $G$ is even, and three faces are distinguished, called holes in $G$. It is known that there exists a packing of cuts…
We construct a polynomial-time algorithm which given a graph $\Gamma$ finds the full set of non-equivalent Cayley representations of $\Gamma$ over the group $D\cong C_p\times C_{p^k}$, where $p\in\{2,3\}$ and $k\geq 1$. This result implies…
We consider the isomorphism problem for hypergraphs taking as input two hypergraphs over the same set of vertices $V$ and a permutation group $\Gamma$ over domain $V$, and asking whether there is a permutation $\gamma \in \Gamma$ that…
An integral equation is a way to encapsulate the relationships between a function and its integrals. We develop a systematic way of describing Volterra integral equations -- specifically an algorithm that reduces any separable Volterra…
The Zero divisor Graph of a commutative ring $R$, denoted by $\Gamma[R]$, is a graph whose vertices are non-zero zero divisors of $R$ and two vertices are adjacent if their product is zero. In this paper we derive the Vertex and Edge…
Using the new extension of the zero-divisor graph $\widetilde{\Gamma}(R)$ introduced in \cite{Groupe}, we give an approach of the diameter of $\Gamma(R)$ and $\Gamma(R[X])$ other than given in \cite{Lucas} thus we give a complete…
We investigate the completely positive semidefinite cone $\mathcal{CS}_+^n$, a new matrix cone consisting of all $n\times n$ matrices that admit a Gram representation by positive semidefinite matrices (of any size). In particular we study…
The nonlinear integral equation P(x)=\int_alpha^beta dy w(y) P(y) P(x+y) is investigated. It is shown that for a given function w(x) the equation admits an infinite set of polynomial solutions P(x). For polynomial solutions, this nonlinear…
We introduce the natural notion of a matching frame in a $2$-dimensional string. A matching frame in a $2$-dimensional $n\times m$ string $M$, is a rectangle such that the strings written on the horizontal sides of the rectangle are…
Given vertex valencies admissible for a self-dual polyhedral graph, we describe an algorithm to explicitly construct such a polyhedron. Inputting in the algorithm permutations of the degree sequence can give rise to non-isomorphic graphs.…
As was detailed by Loewy and London in [Linear and Multilinear Algebra 6 (1978/79), no.~1, 83--90], the cone of polynomials that preserve the nonnegativity of matrices may play an important role in the solution to the nonnegative inverse…
An induced matching in a graph is a set of edges whose endpoints induce a $1$-regular subgraph. It is known that any $n$-vertex graph has at most $10^{n/5} \approx 1.5849^n$ maximal induced matchings, and this bound is best possible. We…
The zero divisor graph of a commutative ring $R$ with unity is a graph whose vertices are the nonzero zero-divisors of the ring, with two distinct vertices being adjacent if their product is zero. This graph is denoted by $\Gamma(R)$. In…