搜索结果: 1-14 共查到“理学 Isomorphism”相关记录14条 . 查询时间(0.049 秒)
ALMOST ISOMORPHISM FOR COUNTABLE STATE MARKOV SHIFTS
ALMOST ISOMORPHISM COUNTABLE STATE MARKOV SHIFTS
font style='font-size:12px;'>
2015/9/29
Countable state Markov shifts are a natural generalization of the well-known subshifts of finite type. They are the subject of current research both for their own sake and as models for smooth dynamic...
BOREL ISOMORPHISM OF SPR MARKOV SHIFTS
BOREL ISOMORPHISM SPR MARKOV SHIFTS
font style='font-size:12px;'>
2015/9/29
We show that strongly positively recurrent Markov shifts (including shifts of finite type) are classified up to Borel conjugacy by their entropy, period and their numbers of periodic points.
THE SATAKE ISOMORPHISM FOR SPECIAL MAXIMAL PARAHORIC HECKE ALGEBRAS
PARAHORIC HECKE Algebra
font style='font-size:12px;'>
2015/9/29
Let G denote a connected reductive group over a nonarchimedean
local field F. Let K denote a special maximal parahoric subgroup of G(F). We
establish a Satake isomorphism for the Hecke algebra...
Polynomial-time Isomorphism Test for Groups with Abelian Sylow Towers
polynomial-time algorithm, group isomorphism, solvable group
font style='font-size:12px;'>
2012/12/3
We consider the problem of testing isomorphism of groups of order n given by Cayley tables. The trivial nlog n bound on the time complexity for the general case has not been improved over the past fou...
On Isomorphism Testing of Groups with Normal Hall Subgroups
Group Isomorphism Problem Normal Hall Subgroups Computational Complexity
font style='font-size:12px;'>
2012/12/3
A normal Hall subgroup N of a group G is a normal subgroup with its order coprime with its index. Schur-Zassenhaus theorem states that every normal Hall subgroup has a complement subgroup, that is a s...
On the Complexity of Matroid Isomorphism Problem
Computational complexity
font style='font-size:12px;'>
2012/12/3
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in p 2 . In the case of linear matroids, which are
represented over polynomially growing fie...
Stable orbit equivalence of Bernoulli actions of free groups and isomorphism of some of their factor actions
Stable orbit equivalence Bernoulli actions isomorphism Dynamical Systems Group Theory
font style='font-size:12px;'>
2011/8/26
Abstract: We give an elementary proof for Lewis Bowen's theorem saying that two Bernoulli actions of two free groups, each having arbitrary base probability spaces, are stably orbit equivalent. Our me...
Sherali-Adams Relaxations of Graph Isomorphism Polytopes
Sherali-Adams Relaxations Graph Isomorphism Polytopes Combinatorics
font style='font-size:12px;'>
2011/8/24
Abstract: We investigate the Sherali-Adams lift & project hierarchy applied to a graph isomorphism polytope whose integer points encode the isomorphisms between two graphs. In particular, the Sherali-...
The Graph Isomorphism Problem and approximate categories
Graph Isomorphism Problem approximate categories
font style='font-size:12px;'>
2011/1/20
It is unknown whether two graphs can be tested for isomorphism in polynomial time. A classical approach to the Graph Isomorphism Problem is the d-dimensional Weisfeiler-Lehman algorithm.
Order-isomorphism and a projection's diagram of C(X)
Commutative C*-algebras projections order-isomorphism infinite projections clopen subsets
font style='font-size:12px;'>
2010/12/21
A mapping between projections of C*-algebras preserving the orthogonality, is called an orthoisomorphism. We define the order-isomorphism mapping on C*-algebras, and using Dye's result, we prove in th...
Determination of the number of isomorphism classes of extensions of a $\kp$-adic field
extensions $\kp$-adic field
font style='font-size:12px;'>
2010/11/8
We deduce a formula enumerating the isomorphism classes of extensions of a $\kp$-adic field $K$ with given ramification $e$ and inertia $f$. The formula follows from a simple group-theoretic lemma, pl...
Isomorphism among families of weighted K3 hypersurfaces
Isomorphism families weighted K3 hypersurfaces
font style='font-size:12px;'>
2010/12/6
Some of the 95 families of weighted K3 hypersurfaces have been known to have the isometric lattice polarizations. It is shown that weighted K3 hyper-surfaces in such families are to one-to-one corresp...
On the Complexity of Matroid Isomorphism Problems
On the Complexity of Matroid Isomorphism Problems
font style='font-size:12px;'>
2012/12/3
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σp 2 . In the case of linear matroids, which are represented over polynomially growing fiel...
The Fibered Isomorphism Conjecture for Complex Manifolds
Complex projective variety Complex surfaces Whitehead group Fibered isomorphism conjecture Negative $K$-groups
font style='font-size:12px;'>
2007/12/11
In this paper we show that the Fibered Isomorphism Conjecture of Farrell and Jones, corresponding to the stable topological pseudoisotopy functor, is true for the fundamental groups of a class of comp...