Results 11 to 20 of about 479 (182)
Fano schemes of determinants and permanents [PDF]
, 2015 Let $D_{m,n}^r$ and $P_{m,n}^r$ denote the subschemes of $\mathbb{P}^{mn-1}$ given by the $r\times r$ determinants (respectively the $r\times r$ permanents) of an $m\times n$ matrix of indeterminates.
Chan, Melody, Ilten, Nathan
core +1 more source
The Extremal Permanental Sum for a Quasi-Tree Graph
Complexity, 2019 Let G be a graph and A(G) the adjacency matrix of G. The permanent of matrix (xI-A(G)) is called the permanental polynomial of G. The permanental sum of G is the sum of the absolute values of the coefficients of permanental polynomial of G. Computing the
Tingzeng Wu, Huazhong Lü
doaj +1 more source
The cycle (circuit) polynomial of a graph with double and triple weights of edges and cycles
Electronic Journal of Graph Theory and Applications, 2019 Farrell introduced the general class of graph polynomials which he called the family polynomials, or F-polynomials, of graphs. One of these is the cycle, or circuit, polynomial.
Vladimir R. Rosenfeld
doaj +1 more source
Shearer's point process, the hard-sphere model and a continuum Lov\'asz Local Lemma [PDF]
, 2017 A point process is R-dependent, if it behaves independently beyond the minimum distance R. This work investigates uniform positive lower bounds on the avoidance functions of R-dependent simple point processes with a common intensity.
Hofer-Temmel, Christoph
core +4 more sources
A Note on the Permanental Roots of Bipartite Graphs
Discussiones Mathematicae Graph Theory, 2014 It is well-known that any graph has all real eigenvalues and a graph is bipartite if and only if its spectrum is symmetric with respect to the origin.
Zhang Heping, Liu Shunyi, Li Wei
doaj +1 more source
Determinantal and permanental representation of q-Fibonacci polynomials
QScience Connect, 2014 In this study, we show determinants and permanents of some Hessenberg matrices that give terms of polynomials .
TAŞYURDU, YASEMİN, GÜLTEKİN, İnci
openaire +2 more sources
Per-Spectral Characterizations Of Some Bipartite Graphs
Discussiones Mathematicae Graph Theory, 2017 A graph is said to be characterized by its permanental spectrum if there is no other non-isomorphic graph with the same permanental spectrum. In this paper, we investigate when a complete bipartite graph Kp,p with some edges deleted is determined by its ...
Wu Tingzeng, Zhang Heping
doaj +1 more source
Intracell interference characterization and cluster interference for D2D communication [PDF]
, 2018 The homogeneous spatial Poisson point process (SPPP) is widely used for spatial modeling of mobile terminals (MTs). This process is characterized by a homogeneous distribution, complete spatial independence, and constant intensity measure. However, it is
Ekti, Ali Riza +4 more
core +3 more sources
Determinantal Processes and Independence
, 2006 We give a probabilistic introduction to determinantal and permanental point processes. Determinantal processes arise in physics (fermions, eigenvalues of random matrices) and in combinatorics (nonintersecting paths, random spanning trees).
Hough, J. Ben +3 more
core +2 more sources
On permanental polynomials of certain random matrices [PDF]
International Mathematics Research Notices, 2006 The paper addresses the calculation of correlation functions of permanental polynomials of matrices with random entries. By exploiting a convenient contour integral representation of the matrix permanent some explicit results are provided for several random matrix ensembles.
openaire +2 more sources