中文
相关论文

相关论文: Z-Pencils

200 篇论文

A foundational question in the theory of linear compartmental models is how to assess whether a model is structurally identifiable -- that is, whether parameter values can be inferred from noiseless data -- directly from the combinatorics…

动力系统 · 数学 2024-02-19 Cashous Bortner , Elizabeth Gross , Nicolette Meshkat , Anne Shiu , Seth Sullivant

Let $X$ be a smooth projective surface such that linear and numerical equivalence of divisors on $X$ coincide and let $\sigma\subseteq |D|$ be a linear pencil on $X$ with integral general fibers. A fiber of $\sigma$ will be called special…

代数几何 · 数学 2008-07-01 Francisco Monserrat

The first author with B. Sturmfels studied the variety of matrices with eigenvectors in a given linear subspace, called Kalman variety. We extend that study from matrices to symmetric tensors, proving in the tensor setting the…

代数几何 · 数学 2020-10-16 Giorgio Ottaviani , Zahra Shahidi

We argue that the standard graph Laplacian is preferable for spectral partitioning of signed graphs compared to the signed Laplacian. Simple examples demonstrate that partitioning based on signs of components of the leading eigenvectors of…

数据结构与算法 · 计算机科学 2018-04-02 Andrew V. Knyazev

The multiparameter matrix pencil problem (MPP) is a generalization of the one-parameter MPP: given a set of $m\times n$ complex matrices $A_0,\ldots, A_r$, with $m\ge n+r-1$, it is required to find all complex scalars…

数值分析 · 数学 2024-06-27 S. K. Gungah , F. F. Alsubaie , I. M. Jaimoukha

We characterize all graphs for which there are eigenvectors of the graph Laplacian having all their components in {-1,+1} or {-1,0,+ 1}. Graphs having eigenvectors with components in {-1,+1} are called bivalent and are shown to be the…

谱理论 · 数学 2018-11-19 J-G. Caputo , I. Khames , A. Knippel

Let $f(x,y)=0$ and $l(x,y)=0$ be respectively a singular and a regular analytic curve defined in the neighborhood of the origin of the complex plane. We study the family of analytic curves $f(x,y)-tl(x,y)^M=0$, where $t$ is a complex…

代数几何 · 数学 2012-08-07 Janusz Gwozdziewicz

We introduce a concept of similarity between vertices of directed graphs. Let G_A and G_B be two directed graphs. We define a similarity matrix whose (i, j)-th real entry expresses how similar vertex j (in G_A) is to vertex i (in G_B. The…

信息检索 · 计算机科学 2007-05-23 Vincent Blondel , Anahi Gajardo , Maureen Heymans , Pierre Senellart , Paul Van Dooren

The pentagram map is a discrete integrable system on the moduli space of planar polygons. The corresponding first integrals are so-called monodromy invariants $E_1, O_1, E_2, O_2,\dots$ By analyzing the combinatorics of these invariants,…

可精确求解与可积系统 · 物理学 2016-10-03 Anton Izosimov

We establish a new class of integrable {\it systems of Kowalevski type}, associated with discriminantly separable polynomials of degree two in each of three variables. Defining property of such polynomials, that all discriminants as…

数学物理 · 物理学 2013-04-16 Vladimir Dragović , Katarina Kukić

The aim of this paper is to investigate further properties of $z$-elements in multiplicative lattices. We utilize $z$-closure operators to extend several properties of $z$-ideals to $z$-elements and introduce various distinguished…

环与代数 · 数学 2025-04-29 Themba Dube , Amartya Goswami

Let $\mathcal{L}$ be a pencil of plane curves defined over $\mathbb{F}_q$ with no $\mathbb{F}_q$-points in its base locus. We investigate the number of curves in $\mathcal{L}$ whose $\mathbb{F}_q$-points form a blocking set. When the degree…

代数几何 · 数学 2025-07-08 Shamil Asgarli , Dragos Ghioca , Chi Hoi Yip

For a random matrix of entries sampled independently from a fairly general distribution in Z we study the probability that the cokernel is isomorphic to a given finite abelian group, or when it is cyclic. This includes the probability that…

概率论 · 数学 2018-06-05 Hoi H. Nguyen , Melanie Matchett Wood

We consider graphs E which have been obtained by adding one or more sinks to a fixed directed graph G. We classify the C*-algebra of E up to a very strong equivalence relation, which insists, loosely speaking, that C*(G) is kept fixed. The…

算子代数 · 数学 2007-05-23 Iain Raeburn , Mark Tomforde , Dana P. Williams

Large H-selfadjoint random matrices are considered. The matrix $H$ is assumed to have one negative eigenvalue, hence the matrix in question has precisely one eigenvalue of nonpositive type. It is showed that this eigenvalue converges in…

泛函分析 · 数学 2012-06-29 Michal Wojtylak

Our purpose is to give new proofs of several known results about perturbations of matrix pencils. Andrzej Pokrzywa (1986) described the closure of orbit of a Kronecker canonical pencil $A-\lambda B$ in terms of inequalities with pencil…

Based on the projective matrix spaces studied by B. Schwarz and A. Zaks, we study the notion of projective space associated to a C*-algebra A with a fixed projection p. The resulting space P(p) admits a rich geometrical structure as a…

算子代数 · 数学 2007-05-23 E. Andruchow , G. Corach , D. Stojanoff

The study of entrywise powers of matrices was originated by Loewner in the pursuit of the Bieberbach conjecture. Since the work of FitzGerald and Horn (1977), it is known that $A^{\circ \alpha} := (a_{ij}^\alpha)$ is positive semidefinite…

组合数学 · 数学 2015-11-24 Dominique Guillot , Apoorva Khare , Bala Rajaratnam

We consider the problem of finding nonzero eigenvalues and the corresponding eigenvectors of a matrix $AA^{\top}$, where $A$ is a special incidence matrix; This matrix can equivalently be defined based on a match relation between some…

组合数学 · 数学 2016-05-24 M. Mohammad-Noori , N. Ghareghani , M. Ghandi

The pentagram map, introduced by R. Schwartz, is defined by the following construction: given a polygon as input, draw all of its "shortest" diagonals, and output the smaller polygon which they cut out. We employ the machinery of cluster…

组合数学 · 数学 2011-04-18 Max Glick