Search results for "CLOSURE"

showing 10 items of 411 documents

Closure to “Analyzing Turbulence Intensity in Gravel Bed Channels” by F. G. Carollo, V. Ferro, and D. Termini

2008

Closure (computer programming)TurbulenceMechanical EngineeringTurbulence kinetic energyGeometryGeomorphologyGeologyWater Science and TechnologyCivil and Structural EngineeringJournal of Hydraulic Engineering
researchProduct

Closure to “Explicit Equations for Uniform Flow Depth” by Vito Ferro and Michele Sciacca

2018

Closure (topology)Potential flowMechanicsAgricultural and Biological Sciences (miscellaneous)GeologyWater Science and TechnologyCivil and Structural EngineeringJournal of Irrigation and Drainage Engineering
researchProduct

Closure to “New Theoretical Solution of the Stage-Discharge Relationship for Sharp-Crested and Broad Weirs” by V. Ferro

2013

A Closure to the paper “A new theoretical solution of the stage-discharge relationship for sharp-crested and broad weirs” is presented

Closure (topology)Settore AGR/08 - Idraulica Agraria E Sistemazioni Idraulico-ForestaliGeotechnical engineeringEfflusso stramazziStage (hydrology)Agricultural and Biological Sciences (miscellaneous)GeologyWater Science and TechnologyCivil and Structural EngineeringJournal of Irrigation and Drainage Engineering
researchProduct

Cyclic and lift closures for k…21-avoiding permutations

2011

We prove that the cyclic closure of the permutation class avoiding the pattern k(k-1)...21 is finitely based. The minimal length of a minimal permutation is 2k-1 and these basis permutations are enumerated by (2k-1).c"k where c"k is the kth Catalan number. We also define lift operations and give similar results. Finally, we consider the toric closure of a class and we propose some open problems.

CombinatoricsCatalan numberDiscrete mathematicsLift (mathematics)PermutationMathematics::CombinatoricsClosure (computer programming)Discrete Mathematics and CombinatoricsTheoretical Computer ScienceCyclic permutationMathematicsDiscrete Mathematics
researchProduct

Quasianalytic Denjoy-Carleman classes and o-minimality

2003

We show that the expansion of the real field generated by the functions of a quasianalytic Denjoy-Carleman class is model complete and o-minimal, provided that the class satisfies certain closure conditions. Some of these structures do not admit analytic cell decomposition, and they show that there is no largest o-minimal expansion of the real field.

CombinatoricsClass (set theory)Mathematics::Complex VariablesApplied MathematicsGeneral MathematicsMathematics::Classical Analysis and ODEsClosure (topology)Resolution of singularitiesCell decompositionMathematicsReal fieldJournal of the American Mathematical Society
researchProduct

Extensions of Representable Positive Linear Functionals to Unitized Quasi *-Algebras: A New Method

2014

In this paper we introduce a topological approach for extending a representable linear functional \({\omega}\), defined on a topological quasi *-algebra without unit, to a representable linear functional defined on a quasi *-algebra with unit. In particular, we suppose that \({\omega}\) is continuous and the positive sesquilinear form \({\varphi_\omega}\), associated with \({\omega}\), is closable and prove that the extension \({\overline{\varphi_\omega}^e}\) of the closure \({\overline{\varphi_\omega}}\) is an i.p.s. form. By \({\overline{\varphi_\omega}^e}\) we construct the desired extension.

CombinatoricsClosure (mathematics)Sesquilinear formSettore MAT/05 - Analisi MatematicaGeneral MathematicsLinear formExtension (predicate logic)Algebra over a fieldinvariant sesquilinear positive forms closable positive sesquilinear forms unitized quasi *-algebrasOmegaUnit (ring theory)Mathematics
researchProduct

Differential equations over polynomially bounded o-minimal structures

2002

We investigate the asymptotic behavior at +∞ of non-oscillatory solutions to differential equations y' = G(t, y), t > a, where G: R 1+l → R l is definable in a polynomially bounded o-minimal structure. In particular, we show that the Pfaffian closure of a polynomially bounded o-minimal structure on the real field is levelled.

CombinatoricsDiscrete mathematicsAsymptotic analysisDifferential equationApplied MathematicsGeneral MathematicsBounded functionClosure (topology)Structure (category theory)PfaffianReal fieldMathematicsProceedings of the American Mathematical Society
researchProduct

Product Integration for Weakly Singular Integral Equations In ℝm

1985

In this note we discuss the numerical solution of the second kind Fredholm integral equation: $$ y(t) = f(t) + \lambda \int\limits_{\Omega } {{{\psi }_{\alpha }}(|t - s|)g(t,s)y(s)ds,\;t \in \bar{\Omega },} $$ (1) Where \( \lambda \in ;\not{ \subset }\backslash \{ 0\} \) , the functions f,g are given and continuous, |.| denotes the Euclidean norm, and φα, 0 \alpha > 0} \\ {\left\{ {\begin{array}{*{20}{c}} {\ln (r),} & {j = 0} \\ {{{r}^{{ - j}}}} & {j > 0} \\ \end{array} } \right\},\alpha = m} \\ \end{array} ,} \right. $$ with Cj not depending on r. Here Ω _ is the closure of a bounded domain Ω⊂ℝm.

CombinatoricsRegular singular pointClosure (mathematics)Product integrationImproper integralDomain (ring theory)Mathematical analysisSingular integralSummation equationOmegaMathematics
researchProduct

European Union Directive: the 8th company law directive on discosure and transparency

2015

Abstract not needed because the work is a voice of an encyclopedia

Company Law Transparency DisclosureSettore SECS-P/07 - Economia Aziendale
researchProduct

Equivalence closure in the two-variable guarded fragment

2015

We consider the satisfiability and finite satisfiability problems for the extension of the two-variable guarded fragment in which an equivalence closure operator can be applied to two distinguished binary predicates. We show that the satisfiability and finite satisfiability problems for this logic are 2-ExpTime-complete. This contrasts with an earlier result that the corresponding problems for the full two-variable logic with equivalence closures of two binary predicates are 2-NExpTime-complete.

Computational complexity theoryLogiccomputational complexityguarded fragmentsatisfiability problemBinary numberTheoretical Computer ScienceCombinatoricsArts and Humanities (miscellaneous)Computer Science::Logic in Computer ScienceClosure operatorEquivalence (formal languages)MathematicsDiscrete mathematicssatisfiability problemcomputational complexitydecidabilityequivalence closureSatisfiabilityDecidabilityTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESClosure (computer programming)Hardware and ArchitectureTheoryofComputation_LOGICSANDMEANINGSOFPROGRAMSBoolean satisfiability problemSoftwareJournal of Logic and Computation
researchProduct