نتایج جستجو برای: essentially algebraic

تعداد نتایج: 114778  

Journal: :Electr. Notes Theor. Comput. Sci. 2008
Alessandra Di Pierro Herbert Wiklicky

We present a logico-algebraic approach to probabilistic abstract interpretation based on the ortholattice structure of the projective measurement operators in quantum mechanics. On this base, we present a novel interpretation of quantum measurement as a probabilistic abstraction showing that the measurement of a physical observable essentially corresponds to a static analysis of the observed pr...

2011
DAN ABRAMOVICH QILE CHEN

We make an observation which enables one to deduce the existence of an algebraic stack of log maps for all generalized Deligne– Faltings log structures (in particular simple normal crossings divisor) from the simplest case with characteristic generated by N (essentially the smooth divisor case).

2007
RAHIM MOOSA SERGEI STARCHENKO

It is shown that in an elementary extension of a compact complex manifold M , the K-analytic sets (where K is the algebraic closure of the underlying real closed field) agree with the ccm-analytic sets if and only if M is essentially saturated. In particular, this is the case for compact Kähler manifolds.

In this paper, we prove some properties of algebraic cone metric spaces and introduce the notion of algebraic distance in an algebraic cone metric space. As an application, we obtain some famous fixed point results in the framework of this algebraic distance.

The concept of weak algebraic hyperstructures or Hv-structures constitutes a generalization of the well-known algebraic hyperstructures (semihypergroup, hypergroup and so on). The overall aim of this paper is to present an introduction to some of the results, methods and ideas about chemical examples of weak algebraic hyperstructures. In this paper after an introduction of basic definitions and...

1999
R. DE LA LLAVE

We study the algebraic structure of several groups of differentiable diffeomorphisms in Sn. We show that any given sufficiently smooth diffeomorphism can be written as the composition of a finite number of diffeomorphisms which are symmetric under reflection, essentially one-dimensional and about as differentiable as the given one.

1973
WALTER MEYER

If V is a vector space over an ordered field F and has algebraic operations + and o, these algebraic operations determine which subsets of V are convex. Now consider a set V with no algebraic structure, but with a convexity structure, that is, a family # of subsets of V which are closed under intersection. The determination of a linear structure (F, +, o) for V which makes V a vector space over...

2005
T. Beck J. Schicho Tobias Beck Josef Schicho

An approximate root of an univariate polynomial over a graded ring A is an element in A for which the evaluated polynomial vanishes up to a prescribed order. We give an algorithm for deciding existence of approximate roots and computing essentially all of them. Based on this algorithm we also suggest a finite representation for multivariate algebraic power series.

2014
M. Lafourcade

Suppose we are given a convex, degenerate, unconditionally intrinsic line Z. A central problem in classical number theory is the computation of essentially algebraic random variables. We show that p ≤ d. Unfortunately, we cannot assume that cos (u) ≡ ∐ Ω∈S Ũ (|E |y,Θ) ∨ · · · ∨ 1−5

Journal: :International Journal for Numerical Methods in Engineering 2022

We study a framework that allows to solve the coarse problem in FETI-DP method approximately. It is based on saddle-point formulation of system with block-triangular preconditioner. One blocks approximates problem, for which we use multilevel BDDC as main tool. This strategy then naturally leads version method, and show spectra preconditioned operators are essentially same. The theory illustrat...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید