搜索结果: 1-15 共查到“数学 degree 3”相关记录65条 . 查询时间(0.125 秒)
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Stability of degree-2 Rossby-Haurwitz waves
2度 罗斯比-豪维茨波 稳定性
2023/5/12
Rossby-Haurwitz waves are an important class of explicit solutions to the incompressible Euler equation on a rotating 2-sphere. We will introduce our recent work on the nonlinear stability of degree-2...
Branch-and-bound algorithm for computing the minimum stability degree of parameter-dependent linear systems
Branch and bound algorithm linear systems a robust nonlinear and linear system stability the parameters of linear system
2015/8/12
We consider linear systems with unspecified parameters that lie between given upper and lower bounds. Except for a few special cases, the computation of many quantities of interest for such systems ca...
RANDOM GRAPHS WITH A GIVEN DEGREE SEQUENCE。
The three-state toric homogeneous Markov chain model has Markov degree two
three-state toric Markov chain model Markov degree two Statistics Theory
2012/7/9
We prove that the three-state toric homogenous Markov chain model has Markov degree two. In algebraic terminology, that a certain class of toric ideals are generated by quadratic binomials. This was c...
Combined degree and connectivity conditions for H-linked graphs
Combined degree connectivity conditions H-linked graphs Combinatorics
2012/6/27
For a given multigraph H, a graph G is H-linked, if |G| \geq |H| and for every injective map {\tau}: V (H) \rightarrow V (G), we can find internally disjoint paths in G, such that every edge from uv i...
This note deals with the relationship between the total number of $k$-walks in a graph, and the sum of the $k$-th powers of its vertex degrees. In particular, it is shown that the the number of all $k...
Counting independent sets of a fixed size in graphs with a given minimum degree
graphs given minimum degree independent sets Combinatorics
2012/4/16
Galvin showed that for all fixed $\delta$ and sufficiently large $n$, the $n$-vertex graph with minimum degree $\delta$ that admits the most independent sets is the complete bipartite graph $K_{\delta...
Stability of tautological bundles on the degree two Hilbert scheme of surfaces
moduli spaces irreducible holomorphic symplectic manifolds K3 surfaces
2012/3/1
Let (X,H) be a polarized smooth projective surface satisfying H^1(X,O_X)=0 and let F be either a rank one torsion-free sheaf or a rank two {\mu}H-stable vector bundle on X. Assume that c_1(F)/=0. In t...
Finiteness of nonzero degree maps between three-manifolds
Finiteness of nonzero degree maps three-manifolds Geometric Topology
2011/9/22
Abstract: In this paper, we prove that every orientable closed 3-manifold dominates at most finitely many homeomorphically distinct irreducible non-geometric 3-manifolds. Moreover, for any integer $d>...
Maximum spectral radius of graphs with given connectivity and minimum degree
connectivity spectral radius Combinatorics
2011/9/21
Abstract: Shiu, Chan and Chang [On the spectral radius of graphs with connectivity at most $k$, J. Math. Chem., 46 (2009), 340-346] studied the spectral radius of graphs of order $n$ with $\kappa(G) \...
On a Greedy 2-Matching Algorithm and Hamilton Cycles in Random Graphs with Minimum Degree at Least Three
Greedy 2-Matching Algorithm Hamilton Cycles Random Graphs Minimum Degree
2011/9/20
Abstract: We describe and analyse a simple greedy algorithm \2G\ that finds a good 2-matching $M$ in the random graph $G=G_{n,cn}^{\d\geq 3}$ when $c\geq 15$. A 2-matching is a spanning subgraph of ma...
On a sparse random graph with minimum degree {three}: Likely Posa's sets are large
random sparse graphs degrees longest path Posa sets
2011/9/20
Abstract: We consider the likely size of the endpoint sets produced by Posa rotations, when applied to a longest path in a random graph with $cn,\,c\geq 2.7$ edges that is conditioned to have minimum ...
Reverse degree distance of unicyclic graphs
Degree Distance Reverse degree distance Diameter Unicyclic graph Pendant vertices Maximum degree
2011/9/1
Abstract: The reverse degree distance is a connected graph invariant closely related to the degree distance proposed in mathematical chemistry. We determine the unicyclic graphs of given girth, number...
Integrability of weight modules of degree 1
Integrability of weight modules Representation Theory Hilbert space
2011/8/26
Abstract: The aim of this article is to find all weight modules of degree 1 of a simple complex Lie algebra that integrate to a continuous representation of a simply-connected real Lie group on some H...
Arithmetical rank of squarefree monomial ideals generated by five elements or with arithmetic degree four
monomial ideal, arithmetical rank, projective dimension
2011/8/24
Abstract: Let $I$ be a squarefree monomial ideal of a polynomial ring $S$. In this paper, we prove that the arithmetical rank of $I$ is equal to the projective dimension of $S/I$ when one of the follo...