Search results for "complex"

showing 10 items of 5889 documents

Positive Versions of Polynomial Time

1998

Abstract We show that restricting a number of characterizations of the complexity class P to be positive (in natural ways) results in the same class of (monotone) problems, which we denote by posP . By a well-known result of Razborov, posP is a proper subclass of the class of monotone problems in P . We exhibit complete problems for posP via weak logical reductions, as we do for other logically defined classes of problems. Our work is a continuation of research undertaken by Grigni and Sipser, and subsequently Stewart; indeed, we introduce the notion of a positive deterministic Turing machine and consequently solve a problem posed by Grigni and Sipser.

Class (set theory)Computational complexity theoryAlgorithmic logicTheoretical Computer ScienceComputer Science ApplicationsCombinatoricsTuring machinesymbols.namesakeMonotone polygonNon-deterministic Turing machineComputational Theory and MathematicsComplexity classsymbolsTime complexityMathematicsInformation Systems
researchProduct

Noise-tolerant efficient inductive synthesis of regular expressions from good examples

1997

We present an almost linear time method of inductive synthesis restoring simple regular expressions from one representative (good) example. In particular, we consider synthesis of expressions of star-height one, where we allow one union operation under each iteration, and synthesis of expressions without union operations from examples that may contain mistakes. In both cases we provide sufficient conditions defining precisely the class of target expressions and the notion of good examples under which the synthesis algorithm works correctly, and present the proof of correctness. In the case of expressions with unions the proof is based on novel results in the combinatorics of words. A genera…

Class (set theory)CorrectnessComputer programComputer Networks and CommunicationsComputer scienceComputer experimentTheoretical Computer ScienceHardware and ArchitectureSimple (abstract algebra)Regular expressionTime complexityAlgorithmSoftwareProgram synthesisNew Generation Computing
researchProduct

Integrability of the one dimensional Schrödinger equation

2018

We present a definition of integrability for the one dimensional Schroedinger equation, which encompasses all known integrable systems, i.e. systems for which the spectrum can be explicitly computed. For this, we introduce the class of rigid functions, built as Liouvillian functions, but containing all solutions of rigid differential operators in the sense of Katz, and a notion of natural boundary conditions. We then make a complete classification of rational integrable potentials. Many new integrable cases are found, some of them physically interesting.

Class (set theory)Integrable systemFOS: Physical sciencesComplex analysisAlgebras01 natural sciencesSchrödinger equationsymbols.namesake[MATH.MATH-MP]Mathematics [math]/Mathematical Physics [math-ph]0103 physical sciencesBoundary value problem0101 mathematics010306 general physicsGauge field theoryMathematical PhysicsMathematical physicsMathematicsMSC: 34M46 34M50 37J30Liouville equation010102 general mathematicsSpectrum (functional analysis)Operator theory[ MATH.MATH-MP ] Mathematics [math]/Mathematical Physics [math-ph]Statistical and Nonlinear PhysicsMathematical Physics (math-ph)Differential operatorHamiltonian mechanicssymbols34M46 34M50 37J30
researchProduct

The arithmetic decomposition of central Cantor sets

2018

Abstract Every central Cantor set of positive Lebesgue measure is the arithmetic sum of two central Cantor sets of Lebesgue measure zero. Under some mild condition this result can be strengthened by stating that the summands can be chosen to be C s regular if the initial set is of this class.

Class (set theory)Mathematics::Dynamical SystemsLebesgue measureApplied Mathematics010102 general mathematicsZero (complex analysis)Analysi02 engineering and technology01 natural sciencesCentral Cantor setCantor setCombinatoricsSet (abstract data type)Arithmetic progression0202 electrical engineering electronic engineering information engineeringDecomposition (computer science)Palis hypothesiArithmetic decomposition020201 artificial intelligence & image processing0101 mathematicsComputer Science::DatabasesAnalysisMathematicsJournal of Mathematical Analysis and Applications
researchProduct

Solutions of nonlinear PDEs in the sense of averages

2012

Abstract We characterize p-harmonic functions including p = 1 and p = ∞ by using mean value properties extending classical results of Privaloff from the linear case p = 2 to all pʼs. We describe a class of random tug-of-war games whose value functions approach p-harmonic functions as the step goes to zero for the full range 1 p ∞ .

Class (set theory)Mean value theoremMathematics(all)Dynamic programming principleGeneral MathematicsAsymptotic expansion01 natural sciences1-harmonicApplied mathematics0101 mathematicsMathematicsp-harmonicApplied Mathematics010102 general mathematicsMathematical analysista111Zero (complex analysis)Sense (electronics)010101 applied mathematicsNonlinear systemRange (mathematics)Two-player zero-sum gamesMean value theorem (divided differences)Viscosity solutionsAsymptotic expansionValue (mathematics)Stochastic gamesJournal de Mathématiques Pures et Appliquées
researchProduct

FROM DISCRETE KINETIC AND STOCHASTIC GAME THEORY TO MODELLING COMPLEX SYSTEMS IN APPLIED SCIENCES

2004

This paper deals with some methodological aspects related to the discretization of a class of integro-differential equations modelling the evolution of the probability distribution over the microscopic state of a large system of interacting individuals. The microscopic state includes both mechanical and socio-biological variables. The discretization of the microscopic state generates a class of dynamical systems defining the evolution of the densities of the discretized state. In general, this yields a system of partial differential equations replacing the continuous integro-differential equation. As an example, a specific application is discussed, which refers to modelling in the field of…

Class (set theory)Partial differential equationDiscretizationField (physics)Dynamical systems theoryApplied Mathematicspopulation modelsMathematical analysisStochastic gameBoltzmann modelsComplex systemnonlinearityModeling and SimulationApplied mathematicsProbability distributiondiscretizationKinetic theoryMathematicsMathematical Models and Methods in Applied Sciences
researchProduct

Separation conditions on controlled Moran constructions

2017

It is well known that the open set condition and the positivity of the $t$-dimensional Hausdorff measure are equivalent on self-similar sets, where $t$ is the zero of the topological pressure. We prove an analogous result for a class of Moran constructions and we study different kinds of Moran constructions with this respect.

Class (set theory)Pure mathematicsAlgebra and Number Theory010102 general mathematicsSeparation (statistics)Zero (complex analysis)Open setDynamical Systems (math.DS)01 natural sciencesTopological pressure0103 physical sciencesFOS: MathematicsQuantitative Biology::Populations and EvolutionHausdorff measure010307 mathematical physicsMathematics - Dynamical Systems0101 mathematicsMathematicsFundamenta Mathematicae
researchProduct

Positivity, complex FIOs, and Toeplitz operators

2018

International audience; We establish a characterization of complex linear canonical transformations that are positive with respect to a pair of strictly plurisubharmonic quadratic weights. As an application, we show that the boundedness of a class of Toeplitz operators on the Bargmann space is implied by the boundedness of their Weyl symbols.

Class (set theory)Pure mathematicsFourier integral operator in the complex domainPrimary: 32U05 32W25 35S30 47B35 70H1570H15Mathematics::Classical Analysis and ODEsOcean EngineeringCharacterization (mathematics)32U05 32W25 35S30 47B35 70H15Space (mathematics)01 natural sciencesMathematics - Analysis of PDEsQuadratic equation0103 physical sciencesFOS: Mathematics0101 mathematics[MATH]Mathematics [math]MathematicsMathematics::Functional Analysispositive canonical transformationMathematics::Complex Variables32U0532W25010102 general mathematicsToeplitz matrixFunctional Analysis (math.FA)Mathematics - Functional Analysis35S30Toeplitz operatorpositive Lagrangian plane010307 mathematical physicsstrictly plurisubharmonic quadratic form47B35Analysis of PDEs (math.AP)Toeplitz operator
researchProduct

The linearized Calderón problem on complex manifolds

2019

International audience; In this note we show that on any compact subdomain of a Kähler manifold that admits sufficiently many global holomorphic functions , the products of harmonic functions form a complete set. This gives a positive answer to the linearized anisotropic Calderón problem on a class of complex manifolds that includes compact subdomains of Stein manifolds and sufficiently small subdomains of Kähler manifolds. Some of these manifolds do not admit limiting Carleman weights, and thus cannot by treated by standard methods for the Calderón problem in higher dimensions. The argument is based on constructing Morse holo-morphic functions with approximately prescribed critical points.…

Class (set theory)Pure mathematicsGeneral MathematicsHolomorphic function01 natural sciencesinversio-ongelmatSet (abstract data type)symbols.namesake[MATH.MATH-AP]Mathematics [math]/Analysis of PDEs [math.AP]0101 mathematics[MATH]Mathematics [math]complex manifoldMathematics::Symplectic GeometryMathematicsosittaisdifferentiaaliyhtälötCalderón problemMathematics::Complex VariablesApplied MathematicsRiemann surface010102 general mathematicsLimitingStandard methodsManifold010101 applied mathematicsHarmonic function[MATH.MATH-DG]Mathematics [math]/Differential Geometry [math.DG]symbolsinverse problemMathematics::Differential Geometrymonistot
researchProduct

Efficient learning of regular expressions from good examples

1994

We consider the problem of restoring regular expressions from expressive examples. We define the class of unambiguous regular expressions, the notion of the union number of an expression showing how many union operations can occur directly under any single iteration, and the notion of an expressive example. We present a polynomial time algorithm which tries to restore an unambiguous regular expression from one expressive example. We prove that if the union number of the expression is 0 or 1 and the example is long enough, then the algorithm correctly restores the original expression from one good example. The proof relies on original investigations in theory of covering symbol sequences (wo…

Class (set theory)Theoretical computer scienceRegular languageRegular expressionInductive reasoningComputer experimentAlgorithmTime complexityExpression (mathematics)Symbol (chemistry)Mathematics
researchProduct