中文
相关论文

相关论文: Diagonal parity and loop toggling for symmetric ma…

200 篇论文

For a simple graph $G$ with vertex set $V(G)=\{v_1,...,v_n\}$, we define the closed neighborhood set of a vertex $u$ as $N[u]=\{v \in V(G) \; | \; v \; \text{is adjacent to} \; u \; \text{or} \; v=u \}$ and the closed neighborhood matrix…

组合数学 · 数学 2024-09-09 Ahmet Batal

This is part of an ongoing project to find a general algebraic framework for semiring theory. The structure theory of semirings is quite challenging, largely because of the lack of negation, and such basic properties such as unique…

环与代数 · 数学 2026-03-30 Marianne Akian , Stephane Gaubert , Louis Rowen

For a simple graph $G=(V,E),$ let $\mathcal{S}_+(G)$ denote the set of real positive semidefinite matrices $A=(a_{ij})$ such that $a_{ij}\neq 0$ if $\{i,j\}\in E$ and $a_{ij}=0$ if $\{i,j\}\notin E$. The maximum positive semidefinite…

组合数学 · 数学 2020-05-29 Chassidy Bozeman

For any simple graph $G$ on $n$ vertices, the (positive semi-definite) minimum rank of $G$ is defined to be the smallest possible rank among all (positive semi-definite) real symmetric $n\times n$ matrices whose entry in position $(i,j)$,…

组合数学 · 数学 2013-12-02 Fatemeh Alinaghipour Taklimi

A set $S$ of vertices in a graph $G$ is a paired dominating set if every vertex of $G$ is adjacent to a vertex in $S$ and the subgraph induced by $S$ contains a perfect matching (not necessarily as an induced subgraph). The paired…

组合数学 · 数学 2025-05-26 Michael A. Henning , Dimbinaina Ralaivaosaona

Let $M$ be a T-motive. We introduce the notion of duality for $M$. Main results of the paper (we consider uniformizable $M$ over $F_q[T]$ of rank $r$, dimension $n$, whose nilpotent operator $N$ is 0): 1. Algebraic duality implies analytic…

数论 · 数学 2019-02-06 A. Grishkov , D. Logachev

Let X be a nonsingular simply connected projective variety of dimension m, E a rank n vector bundle on X, and L a line bundle on X. Suppose that $S^2(E^{*}) \otimes L$ is an ample vector bundle and that there is a constant even rank $r \ge…

alg-geom · 数学 2008-02-03 Bo Ilic , J. M. Landsberg

For a graph $G = (V, E)$ with vertex set $V$ and edge set $E$, a subset $F$ of $E$ is called an $\emph{edge dominating set}$ (resp. a $\emph{total edge dominating set}$) if every edge in $E\backslash F$ (resp. in $E$) is adjacent to at…

组合数学 · 数学 2019-10-15 Zhuo Pan , Yu Yang , Xianyue Li , Shou-Jun Xu

The problem of determining whether a diagonally dominant matrix is singular or nonsingular is a classical topic in matrix theory. This paper develops necessary and sufficient conditions for the singularity or nonsingularity of diagonally…

环与代数 · 数学 2025-12-02 Jidong Jin

Let $M=(m_{ij})$ be a symmetric matrix of order $n$ whose elements lie in an arbitrary field $\mathbb{F}$, and let $G$ be the graph with vertex set $\{1,\ldots,n\}$ such that distinct vertices $i$ and $j$ are adjacent if and only if $m_{ij}…

数据结构与算法 · 计算机科学 2021-10-28 Martin Fürer , Carlos Hoppen , Vilmar Trevisan

We study proper holomorphic maps between bounded symmetric domains $D$ and $\Omega$. In particular, when $D$ and $\Omega$ are of the same rank $\ge 2$ such that all irreducible factors of $D$ are of rank $\ge 2$, we prove that any proper…

复变函数 · 数学 2019-07-18 Shan Tai Chan

We define a class of ranked tree automata TABG generalizing both the tree automata with local tests between brothers of Bogaert and Tison (1992) and with global equality and disequality constraints (TAGED) of Filiot et al. (2007). TABG can…

计算机科学中的逻辑 · 计算机科学 2015-07-01 Luis Barguñó , Carles Creus , Guillem Godoy , Florent Jacquemard , Camille Vacher

A semitotal dominating set of a graph $G$ with no isolated vertex is a dominating set $D$ of $G$ such that every vertex in $D$ is within distance two of another vertex in $D$. The minimum size $\gamma_{t2}(G)$ of a semitotal dominating set…

计算复杂性 · 计算机科学 2018-10-17 Esther Galby , Andrea Munaro , Bernard Ries

Using an analogy with the rank theorem in differential geometry, it is shown that for a finite $n$-tuple $X$ in a tracial von Neumann algebra and any finite $m$-tuple $F$ of $*$-polynomials in $n$ noncommuting indeterminates,…

算子代数 · 数学 2016-02-16 Kenley Jung

A diagram $\mathcal{D} = (G, l)$ over a monoid $M$ is an oriented graph $G = (V, E)$ endowed with a labeling $l\colon E \to M$. A diagram is commutative if and only if for any two oriented paths with the same endpoints, the products in $M$…

组合数学 · 数学 2025-09-16 Artem Malko , Igor Spiridonov

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…

组合数学 · 数学 2020-05-26 Wei Zhuang

A subset $M$ of the edges of a graph $G$ is a matching if no two edges in $M$ are incident. A maximal matching is a matching that is not contained in a larger matching. A subset $S$ of vertices of a graph $G$ with no isolated vertices is a…

组合数学 · 数学 2019-09-09 Selim Bahadır

In this paper we consider the formally symmetric differential expression $M[\cdot]$ of any order (odd or even) $\geq 2$. We characterise the dimension of the quotient space $D(T_{\max})/D(T_{\min})$ associated with $M[\cdot]$ in terms of…

经典分析与常微分方程 · 数学 2007-05-23 K V Alice , V Krishna Kumar , A Padmanabhan

We consider positive solutions, possibly unbounded, to the semilinear equation $-\Delta u=f(u)$ on continuous epigraphs bounded from below. Under the homogeneous Dirichlet boundary condition, we prove new monotonicity results for $u$, when…

偏微分方程分析 · 数学 2025-02-10 Nicolas Beuvin , Alberto Farina , Berardino Sciunzi

We study the Dirichlet problem for fully nonlinear, degenerate elliptic equations of the form f(Hess, u)=0 on a smoothly bounded domain D in R^n. In our approach the equation is replaced by a subset F of the space of symmetric nxn-matrices,…

偏微分方程分析 · 数学 2017-12-12 F. Reese Harvey , H. Blaine Lawson,
‹ 上一页 1 2 3 10 下一页 ›