Search results for " Mathematics"

showing 10 items of 10797 documents

Relative principal congruences in congruence-modular quasivarieties

1998

The problem of definability of relative principal congruences in relatively congruence modular (RCM) quasivarieties is investigated. The RCM quasivarieties are characterized in terms of parameterized families of finite sets of pairs of terms which define relative principal congruences.

Algebra and Number TheoryMathematics::General Mathematicsbusiness.industryMathematics::Number TheoryMathematics::Rings and AlgebrasPrincipal (computer security)Mathematics::General TopologyParameterized complexityModular designCongruence relationAlgebraMathematics::LogicCongruence (manifolds)Algebra over a fieldbusinessFinite setMathematicsAlgebra Universalis
researchProduct

The diamond partial order for strong Rickart rings

2016

The diamond partial order has been first introduced for matrices, and then discussed also in the general context of *-regular rings. We extend this notion to Rickart rings, and state various properties of the diamond order living on the so-called strong Rickart rings. In particular, it is compared with the weak space preorder and the star order; also existence of certain meets and joins under diamond order is discussed.

Algebra and Number TheoryMathematics::Rings and Algebras010102 general mathematicsPreorderOrder (ring theory)JoinsDiamondContext (language use)010103 numerical & computational mathematicsState (functional analysis)engineering.materialStar (graph theory)Space (mathematics)01 natural sciencesCombinatoricsengineering0101 mathematicsMathematicsLinear and Multilinear Algebra
researchProduct

On strong solutions of the differential equations modeling the steady flow of certain incompressible generalized Newtonian fluids

2007

In this paper we discuss a system of partial differential equations describing the steady flow of an incompressible fluid and prove the existence of a strong solution under suitable assumptions on the data. In the 2D-case this solution turns out to be of class C^{1,\alpha}.

Algebra and Number TheoryPartial differential equationDifferential equationApplied MathematicsMathematical analysis510Physics::Fluid DynamicsStrong solutionsGeneralized Newtonian fluidFlow (mathematics)CompressibilityNewtonian fluidAnalysisMathematicsSt. Petersburg Mathematical Journal
researchProduct

Existence of dynamical low-rank approximations to parabolic problems

2021

The existence and uniqueness of weak solutions to dynamical low-rank evolution problems for parabolic partial differential equations in two spatial dimensions is shown, covering also non-diagonal diffusion in the elliptic part. The proof is based on a variational time-stepping scheme on the low-rank manifold. Moreover, this scheme is shown to be closely related to practical methods for computing such low-rank evolutions.

Algebra and Number TheoryPartial differential equationRank (linear algebra)Applied MathematicsNumerical Analysis (math.NA)010103 numerical & computational mathematics01 natural sciencesManifold010101 applied mathematics35K15 35R01 (Primary) 15A69 65L05 (Secondary)Computational MathematicsMathematics - Analysis of PDEsScheme (mathematics)FOS: MathematicsApplied mathematicsUniquenessMathematics - Numerical Analysisddc:5100101 mathematicsDiffusion (business)Analysis of PDEs (math.AP)Mathematics
researchProduct

Rejoinder on: Natural Induction: An Objective Bayesian Approach

2009

Giron and Moreno. We certainly agree with Professors Giron and Moreno on the interest in sensitivity of any Bayesian result to changes in the prior. That said, we also consider of considerable pragmatic importance to be able to single out a unique, particular prior which may reasonably be proposed as the reference prior for the problem under study, in the sense that the corresponding posterior of the quantity of interest could be routinely used in practice when no useful prior information is available or acceptable. This is precisely what we have tried to do for the twin problems of the rule of succession and the law of natural induction. The discussants consider the limiting binomial versi…

Algebra and Number TheoryRule of successionApplied MathematicsBayesian probabilityComputational MathematicsPrior probabilityNatural (music)Geometry and TopologySensitivity (control systems)Problem of inductionNull hypothesisMathematical economicsAnalysisMathematicsStatistical hypothesis testing
researchProduct

A Criterium for the Strict Positivity of the Density of the Law of a Poisson Process

2011

We translate in semigroup theory our result (Leandre, 1990) giving a necessary condition so that the law of a Markov process with jumps could have a strictly positive density. This result express, that we have to jump in a finite number of jumps in a "submersive" way from the starting point to the end point if the density of the jump process is strictly positive in . We use the Malliavin Calculus of Bismut type of (Leandre, (2008;2010)) translated in semi-group theory as a tool, and the interpretation in semi-group theory of some classical results of the stochastic analysis for Poisson process as, for instance, the formula giving the law of a compound Poisson process.

Algebra and Number TheorySemigroupStochastic processlcsh:MathematicsApplied MathematicsMarkov processlcsh:QA1-939Malliavin calculussymbols.namesakeLawCompound Poisson processJumpsymbolsFinite setJump processAnalysisMathematicsAdvances in Difference Equations
researchProduct

Parallel fictitious domain method for a non‐linear elliptic neumann boundary value problem

1999

Parallelization of the algebraic fictitious domain method is considered for solving Neumann boundary value problems with variable coefficients. The resulting method is applied to the parallel solution of the subsonic full potential flow problem which is linearized by the Newton method. Good scalability of the method is demonstrated on a Cray T3E distributed memory parallel computer using MPI in communication. Copyright © 1999 John Wiley & Sons, Ltd.

Algebra and Number TheoryShooting methodFictitious domain methodApplied MathematicsMathematical analysisNeumann–Dirichlet methodNeumann boundary conditionFree boundary problemBoundary value problemMixed boundary conditionElliptic boundary value problemMathematicsNumerical Linear Algebra with Applications
researchProduct

A posteriori estimates for the stationary Stokes problem in exterior domains

2020

This paper is concerned with the analysis of the inf-sup condition arising in the stationary Stokes problem in exterior domains and applications to the derivation of computable bounds for the distance between the exact solution of the exterior Stokes problem and a certain approximation (which may be of a rather general form). In the first part, guaranteed bounds are deduced for the constant in the stability lemma associated with the exterior domain. These bounds depend only on known constants and the stability constant related to bounded domains that arise after suitable truncations of the unbounded domains. The lemma in question implies computable estimates of the distance to the set of di…

Algebra and Number TheoryStokes problemApplied MathematicsMathematikStokes problemApplied mathematicsA priori and a posterioriposteriori estimatesAnalysisMathematicsSt. Petersburg Mathematical Journal
researchProduct

TWO-DIMENSIONAL FINITE STATE RECOGNIZABILITY

1996

The purpose of this paper is to investigate about a new notion of finite state recognizability for two-dimensional (picture) languages. This notion takes as starting point the characterization of one-dimensional recognizable languages in terms of local languages and projections. Such notion can be extended in a natural way to the two-dimensional case. We first introduce a notion of local picture language and then we define,a recognizable picture language as a projection of a local picture language. The family of recognizable picture languages is denoted by REC. We study some combinatorial and language-theoretic properties of family REC. In particular we prove some closure properties with re…

Algebra and Number TheoryString (computer science)Abstract family of languagesComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Ontology languagePicture languageCone (formal languages)Theoretical Computer ScienceUndecidable problemAlgebraComputational Theory and MathematicsClosure (mathematics)Regular languageComputer Science::Programming LanguagesComputer Science::Formal Languages and Automata TheoryInformation SystemsMathematicsFundamenta Informaticae
researchProduct

Varieties with at most cubic growth

2019

Abstract Let V be a variety of non necessarily associative algebras over a field of characteristic zero. The growth of V is determined by the asymptotic behavior of the sequence of codimensions c n ( V ) , n = 1 , 2 , … , and here we study varieties of polynomial growth. We classify all possible growth of varieties V of algebras satisfying the identity x ( y z ) ≡ 0 such that c n ( V ) C n α , with 1 ≤ α 3 , for some constant C. We prove that if 1 ≤ α 2 then c n ( V ) ≤ C 1 n , and if 2 ≤ α 3 , then c n ( V ) ≤ C 2 n 2 , for some constants C 1 , C 2 .

Algebra and Number TheoryVarietie010102 general mathematicsZero (complex analysis)Field (mathematics)01 natural sciencesCombinatoricsIdentity (mathematics)Settore MAT/02 - Algebra0103 physical sciences010307 mathematical physics0101 mathematicsVariety (universal algebra)Codimension growthMathematics
researchProduct