云南高校图书馆联盟文献共享服务平台- CONNECTED

CONNECTED: 作品数：779被引量：921H指数：13; 导出分析报告; 相关领域：理学更多>>; 相关作者：杨波邢璐王炜李烨王昊更多>>; 相关机构：北京航天发射技术研究所上海交通大学中国科学院数学与系统科学研究院上海师范大学更多>>; 相关期刊：更多>>; 相关基金：国家自然科学基金国家重点基础研究发展计划中国博士后科学基金北京市自然科学基金更多>>

On 1-connected 8-manifolds with the Same Homology as S^(3)×S^(5): 《Acta Mathematica Sinica,English Series》2021年第6期941-956,共16页Xue Qi WANG; In this article,we classify 1-connected 8-dimensional Poincarécomplexes,topological manifolds and smooth manifolds whose integral homology groups are isomorphic to those of S^(3)×S^(5).A topic related to a paper of ...; 关键词：8-manifolds Poincarécomplexes diffeomorphism groups S^(1)-bundles

Mapping of Least ρ-Dirichlet Energy between Doubly Connected Riemann Surfaces: 《Acta Mathematica Sinica,English Series》2020年第6期663-672,共10页Li ZHANG Sheng Jin HUO Hui GUO Xiao Gao FENG; Supported by the National Natural Science Foundation of China(Grant No.11701459);the Natural Science Foundation of Sichuan Provincial Department of Education(Grant No.17ZB0431);the Research Startup of China West Normal University(Grant No.17E88);supported by the Science and Technology Development Fund of Tianjin Commission for Higher Education(Grant No.2017KJ095)。; In this note,we consider the mappings h:X→Y between doubly connected Riemann surfaces having leastρ-Dirichlet energy.For a pair of doubly connected Riemann surfaces,in which X has finite conformal modulus,we establi...; 关键词：ρ-Dirichlet energy Hopf-differential ρ-harmonic mapping ρ-Nitsche conjecture

Sufficient Conditions for Maximally Edge-connected and Super-edge-connected Digraphs Depending on the Size: 《Acta Mathematica Sinica,English Series》2019年第12期1861-1870,共10页Sebastian MILZ Lutz VOLKMANN; Let D be a finite and simple digraph with vertex set V(D).The minimum degreeδof a digraph D is defined as the minimum value of its out-degrees and its in-degrees.If D is a digraph with minimum degreeδand edge-connec...; 关键词：DIGRAPHS EDGE-CONNECTIVITY MAXIMALLY edge-connected DIGRAPHS super-edge-connected DIGRAPHS

Estimates of the Isovariant Borsuk–Ulam Constants of Connected Compact Lie Groups: 《Acta Mathematica Sinica,English Series》2018年第10期1485-1500,共16页Ikumitsu NAGASAKI; The isovariant Borsuk Ulam constant cc of a compact Lie group G is defined to be the supremum of c ∈ R such that the inequalityc（dim V - dim V^C） ≤ dim W - dim W^Gholds whenever there exists a G-isovariant map f ...; 关键词：Isovariant map Borsuk-Ulam type theorem Borsuk Ulam constant transformation groups representation theory

Solution to an Extremal Problem on Bigraphic Pairs with a Z3-connected Realization: 《Acta Mathematica Sinica,English Series》2017年第8期1131-1153,共23页Jian Hua YIN Xiang Yu DAI; Supported by National Natural Science Foundation of China(Grant No.11561017);Natural Science Foundation of Hainan Province(Grant No.2016CXTD004); Let S = （a1,...,am;b1,...,bn）, where a1,...,am and b1,...,bn are two nonincreasing sequences of nonnegative integers. The pair S= （a1,..., am; b1,..., bn） is said to be a bigraphic pair if there is a simple bipart...; 关键词：Bigraphic pair Z3-connected realization group connectivity

The General Facility Location Problem with Connectivity on Trees: 《Acta Mathematica Sinica,English Series》2016年第9期1106-1112,共7页Er Fang SHAN Li Ying KANG; Supported by National Nature Science Foundation of China(Grant Nos.11471210,11571222); In this note we study the general facility location problem with connectivity. We present an O（np2）-time algorithm for the general facility location problem with connectivity on trees. Furthermore,we present an O（n...; 关键词：Connected p-center connected p-median TREE equivalent binary tree

Heavy Cycles in 2-connected Triangle-free Weighted Graphs: 《Acta Mathematica Sinica,English Series》2015年第10期1555-1562,共8页Xue Zheng LV Pei WANG; Supported by National Natural Science Foundation of China(Grant No.11001269); A weighted graph is one in which every edge e is assigned a nonnegative number, called the weight of e. The sum of the weights of the edges incident with a vertex v is called the weighted degree of v, denoted by dw（v...; 关键词：Heavy cycles triangle-free graphs weighted graphs

Nowhere-zero 15-Flow in 3-Edge-connected Bidirected Graphs: 《Acta Mathematica Sinica,English Series》2014年第4期649-660,共12页Er Ling WEI Wen Liang TANG Dong YE; Supported by the Fundamental Research Funds for the Central Universities;the Research Funds of Renmin University of China Project(Grant No.10XNB054); It was conjectured by Bouchet that every bidirected graph which admits a nowhere-zero κ flow will admit a nowhere-zero 6-flow. He proved that the conjecture is true when 6 is replaced by 216. Zyka improved the result...; 关键词：Bidirected graph integer flow signed graph

Super Cyclically Edge-connected Vertex-transitive Graphs of Girth at Least 5: 《Acta Mathematica Sinica,English Series》2013年第8期1569-1580,共12页Jin Xin ZHOU Yan Tao LI; supported by National Natural Science Foundation of China (Grant No.11271012);the Fundamental Research Funds for the Central Universities (Grant Nos.2011JBM127,2011JBZ012);supported by National Natural Science Foundation of China (Grant No.11101035);the Subsidy for Outstanding People of Beijing (Grant No.2011D005022000005); A cyclic edge-cut of a graph G is an edge set, the removal of which separates two cycles. If G has a cyclic edge-cut, then it is called cyclically separable. We call a cyclically separable graph super cyclically edge-...; 关键词：Cyclic edge-cut cyclic edge-connectivity super cyclically edge-connected vertex-transit-ive graphs

Inequality of Nordhaus-Gaddum Type for Total Outer-connected Domination in Graphs: 《Acta Mathematica Sinica,English Series》2011年第3期607-616,共10页Hong Xing JIANG Li Ying KANG; Supported by National Natural Science Foundation of China （Grant Nos. 60773078, 10971131） and Shanghai Leading Academic Discipline Project （Grant No. S30104） Thank the referees sincerely for all of the helpful suggestions.; A set S of vertices in a graph G = （V, E） without isolated vertices is a total outer-connected dominating set （TCDS） of G if S is a total dominating set of G and G[V - S] is connected. The total outer-connected do...; 关键词：GRAPH domination number total outer-connected domination Nordhaus-Gaddum inequality

CONNECTED