We apply matrix theory over $\mathbb{F}_2$ to understand the nature of so-called "successful pressing sequences" of black-and-white vertex-colored graphs. These sequences arise in computational phylog...
In his study of periodic orbits of the 3 body problem, Hill obtained a formula relating the characteristic polynomial of the monodromy matrix of a periodic orbit and an infinite determinant of the Hes...
We leverage second-order information for tuning of inverse optimal controllers for a class of discrete-time nonlinear input-affine systems. For this, we select the input penalty matrix, representing a...
In this paper we develop a lattice-based computational model focused on bone resorption by osteoclasts in a single cortical basic multicellular unit (BMU). Our model takes into account the interaction...
Designing efficient quasi-Newton methods is an important problem in nonlinear optimization and the solution of systems of nonlinear equations. From the perspective of the matrix approximation process,...
The paper is devoted to studies of perturbed Markov chains commonly used for description of information networks. In such models, the matrix of transition probabilities for the corresponding Markov ch...
A necessary condition for a connection in a vector bundle to be locally metric is for its curvature matrix, which consists of $2$ forms, to be skew symmetric with respect to some local frame. In this ...
A phase diagram for the step faceting phase, the step droplet phase, and the Gruber-Mullins-Pokrovsky-Talapov (GMPT) phase on a crystal surface is obtained by calculating the surface tension with the ...
In this paper, authors want to comment on a recently published article describing the Mathematical Modeling of Current Source Matrix Converter (CSMC) with two modulation strategies, namely: Venturini ...
I review the Lee-Nauenberg thereom and discuss its inclusion of photons which are disconnected at the level of the S-matrix but connected at the level of the cross-section when there are initial and f...
A linear map between matrix spaces is positive if it maps positive semidefinite matrices to positive semidefinite ones, and is called completely positive if all its ampliations are positive. In this a...
We present an approach to decomposition and factor analysis of matrices with ordinal data. The matrix entries are grades to which objects represented by rows satisfy attributes represented by columns,...
A nut graph is a simple graph whose kernel is spanned by a single full vector (i.e. the adjacency matrix has a single zero eigenvalue and all non-zero kernel eigenvectors have no zero entry). We class...
A nut graph is a graph on at least 2 vertices whose adjacency matrix has nullity 1 and for which non-trivial kernel vectors do not contain a zero. Chemical graphs are connected, with maximum degree at...
A nut graph is a nontrivial simple graph whose adjacency matrix contains a one-dimensional null space spanned by a vector without zero entries. Moreover, an $\ell$-circulant graph is a graph that admi...
Past efforts to map the Medline database have been limited to small subsets of the available data because of the exponentially increasing memory and processing demands of existing algorithms. We desig...
Two recent papers proved that complex index pairings can be calculated as the half-signature of a finite dimensional matrix, called the spectral localizer. This paper contains a new proof of this conn...
The spectral localizer, introduced by Loring in 2015 and Loring and Schulz-Baldes in 2017, is a method to compute the (infinite volume) topological invariant of a quantum Hamiltonian on $\ZZ^d$, as th...
Based on random matrix theory, we compute the likelihood of saddles and minima in a class of random potentials that are softly bounded from above and below, as required for the validity of low energy ...
