نتایج جستجو برای: maximal chain
تعداد نتایج: 380381 فیلتر نتایج به سال:
We consider reduced Witt rings of finite chain length. We show there is a bound, in terms of the chain length and maximal signature, on the dimension of anisotropic, totally indefinite forms. From this we get the ascending chain condition on principal ideals and hence factorization of forms into products of irreducible forms. 2000 Mathematics Subject Classification: 11E81, 12D15
We test a Markov chain approximation to the segment description (Li, 2007) of chaos (and turbulence) on a tent map, the Minea system, the Hénon map, and the Lorenz system. For the tent map, we compute the probability transition matrix of the Markov chain on the segments for segment time length (iterations) T = 1, 2, 3, 100. The matrix has 1, 2, 4 tents corresponding to T = 1, 2, 3; and is almos...
let $r$ be a commutative ring with identity and let $m$ be an $r$-module. a proper submodule $p$ of $m$ is called strongly prime submodule if $(p + rx : m)ysubseteq p$ for $x, yin m$, implies that $xin p$ or $yin p$. in this paper, we study more properties of strongly prime submodules. it is shown that a finitely generated $r$-module $m$ is artinian if and only if $m$ is noetherian and every st...
It is proven that each indecomposable injective module over a valuation domain R is polyserial if and only if each maximal immediate extension R̂ of R is of finite rank over the completion R̃ of R in the R-topology. In this case, for each indecomposable injective module E, the following invariants are finite and equal: its Malcev rank, its Fleischer rank and its dual Goldie dimension. Similar res...
A (p, q)-ary chain is a special type of chain partition of integers with parts of the form pq for some fixed integers p and q. In this note, we are interested in the maximal weight of such partitions when their parts are distinct and cannot exceed a given bound m. Characterizing the cases where the greedy choice fails, we prove that this maximal weight is, as a function of m, asymptotically ind...
A symmetric group action on the maximal chains in a finite, ranked poset is local if the adjacent transpositions act in such a way that (i, i+ 1) sends each maximal chain either to itself or to one differing only at rank i. We prove that when Sn acts locally on a lattice, each orbit considered as a subposet is a product of chains. We also show that all posets with local actions induced by label...
MATHEMATICAL ENGINEERING TECHNICAL REPORTS Standard Imsets for Undirected and Chain Graphical Models
We derive standard imsets for undirected graphical models and chain graphical models. Standard imsets for undirected graphical models are described in terms of minimal triangulations for maximal prime subgraphs of the undirected graphs. For describing standard imsets for chain graphical models, we first define a triangulation of a chain graph. We then use the triangulation to generalize our res...
The effect of perturbations of parameters for uniquely convergent imprecise Markov chains is studied. We provide the maximal distance between the distributions of original and perturbed chain and maximal degree of imprecision, given the imprecision of the initial distribution. The bounds on the errors and degrees of imprecision are found for the distributions at finite time steps, and for the s...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید