English
Related papers

Related papers: Cauchy-Binet for Pseudo-Determinants

200 papers

We prove that every matrix-valued rational function $F$, which is regular on the closure of a bounded domain $\mathcal{D}_\mathbf{P}$ in $\mathbb{C}^d$ and which has the associated Agler norm strictly less than 1, admits a…

Let $G$ be a graph on $n$ vertices, its adjacency matrix and degree diagonal matrix are denoted by $A(G)$ and $D(G)$, respectively. In 2017, Nikiforov \cite{0007} introduced the matrix $A_{\alpha}(G)=\alpha D(G)+(1-\alpha)A(G)$ for…

Combinatorics · Mathematics 2021-03-09 Shuchao Li , Wanting Sun

In this work, the determinants of matrices constructed by evaluating homogeneous bivariate polynomials at pairs of vectors are investigated. For a polynomial $p(x,y)=\sum\limits_{i=0}^k \alpha_i x^{k-i}y^i$, an explicit factorization of the…

Rings and Algebras · Mathematics 2026-01-27 Somphong Jitman , Wannarut Rungrottheera

Given a simple, finite, nonempty graph $G=(V(G),E(G))$, a vertex subset $D\subseteq V(G)$ is said to be a dominating set if every vertex $v\in V(G)-D$ is adjacent to a vertex in $D$. The independent domination number $\gamma_i(G)$ is the…

Combinatorics · Mathematics 2025-11-24 Andrew Pham

Let $f: X \to Y$ be a dominant morphism of smooth, proper and geometrically integral varieties over a number field $k$, with geometrically integral generic fibre. We give a necessary and sufficient geometric criterion for the induced map…

Algebraic Geometry · Mathematics 2018-09-28 Daniel Loughran , Alexei N. Skorobogatov , Arne Smeets

In the objective of studying concentration and oscillation properties of eigenfunctions of the discrete Laplacian on regular graphs, we construct a pseudo-differential calculus on homogeneous trees, their universal covers. We define symbol…

Spectral Theory · Mathematics 2018-03-28 Etienne Le Masson

Suppose $G$ is a controllable graph of order $n$ with adjacency matrix $A$. Let $W=[e,Ae,\ldots,A^{n-1}e]$ ($e$ is the all-one vector) and $\Delta=\prod_{i>j}(\alpha_i-\alpha_j)^2$ ($\alpha_i$'s are eigenvalues of $A$) be the walk matrix…

Combinatorics · Mathematics 2025-04-18 Songlin Guo , Wei Wang , Wei Wang

Let $G$ be a simple graph of order $n$. An independent set in a graph is a set of pairwise non-adjacent vertices. The independence polynomial of $G$ is the polynomial $I(G,x)=\sum_{k=0}^{n} s(G,k) x^{k}$, where $s(G,k)$ is the number of…

Combinatorics · Mathematics 2013-03-14 Mohammad Reza Oboudi

We consider the adjacency matrix associated with a graph that describes transitions between $2^{N}$ states of the discrete Preisach memory model. This matrix can also be associated with the last-in-first-out inventory management rule. We…

Mathematical Physics · Physics 2017-09-21 Tamas Kalmar-Nagy , Andreas Amann , Daniel Kim , Dmitrii Rachinskii

The system of undetermined coefficients of a bifurcation problem G[z]=0 in Banach spaces is investigated for proving the existence of families of solution curves by use of the implicit function theorem. The main theorem represents an…

Algebraic Geometry · Mathematics 2019-07-23 Matthias Stiefenhofer

The classification of one parameter local Coulomb branch solution of theories with eight supercharges is given by assuming that it is given by a genus $g$ fiberation of Riemann surfaces. The crucial point is the fact that certain conjugacy…

High Energy Physics - Theory · Physics 2023-04-27 Dan Xie

We introduce the concept of subalgebra spectrum, $Sp(A)$, for a subalgebra $A$ of finite codimension in $\mathbb{K}[x]$. The spectrum is a subset of the underlying field. We also introduce a tool, the characteristic polynomial of $A$, which…

Rings and Algebras · Mathematics 2021-07-27 Rode Grönkvist , Erik Leffler , Anna Torstensson , Victor Ufnarovski

We provide a combinatorial way of computing Speyer's $g$-polynomial on arbitrary Schubert matroids via the enumeration of certain Delannoy paths. We define a new statistic of a basis in a matroid, and express the $g$-polynomial of a…

Combinatorics · Mathematics 2024-01-15 Luis Ferroni

A set $S$ of vertices in $G$ is a semitotal dominating set of $G$ if it is a dominating set of $G$ and every vertex in $S$ is within distance $2$ of another vertex of $S$. The \emph{semitotal domination number}, $\gamma_{t2}(G)$, is the…

Combinatorics · Mathematics 2020-05-26 Wei Zhuang

Any finite dimensional semisimple algebra A over a field K is isomorphic to a direct sum of finite dimensional full matrix rings over suitable division rings. In this paper we will consider the special case where all division rings are…

Rings and Algebras · Mathematics 2020-12-29 Ayten Koç , Songül Esin , Ismail Güloğlu , Müge Kanuni , Ayten Koc , Songul Esin , Ismail Guloglu , Muge Kanuni

It is shown that a flat subgroup, $H$, of the totally disconnected, locally compact group $G$ decomposes into a finite number of subsemigroups on which the scale function is multiplicative. The image, $P$, of a multiplicative semigroup in…

Group Theory · Mathematics 2017-10-03 Cheryl E. Praeger , Jacqui Ramagge , George Willis

Determinantal ideals of graphs generalize, among others, the spectrum and the Smith normal form (SNF) of integer matrices associated to graphs. In this work we investigate the relationship of the spectrum and the SNF with the determinantal…

Combinatorics · Mathematics 2019-10-29 Aida Abiad , Carlos A. Alfaro , Kristin Heysse , Marcos C. Vargas

If $G$ is a group acting on a tree $X$, and ${\mathcal S}$ is a $G$-equivariant sheaf of vector spaces on $X$, then its compactly-supported cohomology is a representation of $G$. Under a finiteness hypothesis, we prove that if $H_c^0(X,…

Representation Theory · Mathematics 2018-10-04 Martin H. Weissman

A finite abstract simplicial complex G defines the Barycentric refinement graph phi(G) = (G,{ (a,b), a subset b or b subset a }) and the connection graph psi(G) = (G,{ (a,b), a intersected with b not empty }). We note here that both…

Combinatorics · Mathematics 2020-12-15 Oliver Knill

Recently, Gutman [MATCH Commun. Math. Comput. Chem. 86 (2021) 11-16] defined a new graph invariant which is named the Sombor index $\mathrm{SO}(G)$ of a graph $G$ and is computed via the expression \[ \mathrm{SO}(G) = \sum_{u \sim v}…

Combinatorics · Mathematics 2024-05-24 Ivan Damnjanović , Dragan Stevanović