Search results for "Finite set"

showing 10 items of 101 documents

Optical analogy to electronic quantum corrals.

2000

We describe full multiple-scattering calculations of localized surface photonic states set up by lithographically designed nanostructures made of a finite number of dielectric pads deposited on a planar surface. The method is based on a numerical solution of the dyadic Dyson's equation. When the pads are arranged to form a closed circle, we find field patterns that look like the electronic charge density recently observed above quantum corrals. We propose two experimental techniques that could be used to observe these electromagnetic modes in direct space.

PhysicsSurface (mathematics)PlanarField (physics)business.industryQuantum mechanicsGeneral Physics and AstronomyDielectricPhotonicsSpace (mathematics)businessFinite setQuantumPhysical review letters
researchProduct

Reconstruction of time-dependent coefficients: a check of approximation schemes for non-Markovian convolutionless dissipative generators

2010

We propose a procedure to fully reconstruct the time-dependent coefficients of convolutionless non-Markovian dissipative generators via a finite number of experimental measurements. By combining a tomography based approach with a proper data sampling, our proposal allows to relate the time-dependent coefficients governing the dissipative evolution of a quantum system to experimentally accessible quantities. The proposed scheme not only provides a way to retrieve full information about potentially unknown dissipative coefficients but also, most valuably, can be employed as a reliable consistency test for the approximations involved in the theoretical derivation of a given non-Markovian convo…

PhysicsTomography Convolutionless master equationQuantum PhysicsQuantum decoherenceSettore FIS/02 - Fisica Teorica Modelli E Metodi MatematiciStochastic processSampling (statistics)Markov processFOS: Physical sciencesAtomic and Molecular Physics and Opticssymbols.namesakeQuantum mechanicsMaster equationDissipative systemsymbolsQuantum systemStatistical physicsQuantum Physics (quant-ph)Finite set
researchProduct

Discrete-valued-pulse optimal control algorithms: Application to spin systems

2015

International audience; This article is aimed at extending the framework of optimal control techniques to the situation where the control field values are restricted to a finite set. We propose generalizations of the standard GRAPE algorithm suited to this constraint. We test the validity and the efficiency of this approach for the inversion of an inhomogeneous ensemble of spin systems with different offset frequencies. It is shown that a remarkable efficiency can be achieved even for a very limited number of discrete values. Some applications in nuclear magnetic resonance are discussed.

Physics[ MATH.MATH-OC ] Mathematics [math]/Optimization and Control [math.OC]Offset (computer science)3280QkInversion (meteorology)010402 general chemistryOptimal control3710Vz01 natural sciencesAtomic and Molecular Physics and Optics0104 chemical sciences7820Bh3280Qk 3710Vz 7820Bh0103 physical sciences[MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC]010306 general physicsAlgorithmFinite set
researchProduct

Maxwell Theory as a Classical FieldTheory

2012

Hamilton’s variational principle and the Lagrangian mechanics that rests on it are exceedingly successful in their application to mechanical systems with a finite number of degrees of freedom. Hamilton’s principle characterizes the physically realizable orbits, among the set of all possible orbits, as being the critical elements of the action integral. The Lagrangian function, although not an observable on its own, is not only useful in deriving the equations of motion but is also an important tool for identifying symmetries of the theory and constructing the corresponding conserved quantities, via Noether’s theorem.

Physicssymbols.namesakeClassical mechanicsVariational principleLagrangian mechanicsDegrees of freedom (physics and chemistry)symbolsEquations of motionNoether's theoremConserved quantityFinite setAction (physics)
researchProduct

Exact results for the homogeneous cooling state of an inelastic hard-sphere gas

1998

The infinite set of moments of the two-particle distribution function is found exactly for the uniform cooling state of a hard-sphere gas with inelastic collisions. Their form shows that velocity correlations cannot be neglected, and consequently the 'molecular chaos' hypothesis leading to the inelastic Boltzmann and Enskog kinetic equations must be questioned. © 1998 Cambridge University Press.

Physicssymbols.namesakeInfinite setClassical mechanicsDistribution functionBoltzmann constantsymbolsInelastic collisionMolecular chaosHard spheresInelastic scatteringCondensed Matter PhysicsBoltzmann equationJournal of Plasma Physics
researchProduct

On the arithmetically Cohen-Macaulay property for sets of points in multiprojective spaces

2017

We study the arithmetically Cohen-Macaulay (ACM) property for finite sets of points in multiprojective spaces, especially ( P 1 ) n (\mathbb P^1)^n . A combinatorial characterization, the ( ⋆ ) (\star ) -property, is known in P 1 × P 1 \mathbb P^1 \times \mathbb P^1 . We propose a combinatorial property, ( ⋆ s ) (\star _s) with 2 ≤ s ≤ n 2\leq s\leq n , that directly generalizes the ( ⋆ ) (\star ) -property to ( P 1 ) n (\mathbb P^1)^n for larger n n . We show that X X is ACM if and only if it satisfies the ( ⋆ n ) (\star _n) -property. The main tool for several of our results is an extension to the multiprojective setting of certain liaison methods in projective space.

Property (philosophy)General MathematicsStar (game theory)Arithmetically Cohen-Macaulay; Linkage; Points in multiprojective spacescohen- macaulayCharacterization (mathematics)Commutative Algebra (math.AC)01 natural sciencesCombinatoricsMathematics - Algebraic GeometryPoints in multiprojective spaces0103 physical sciencesFOS: MathematicsProjective space0101 mathematicsFinite setAlgebraic Geometry (math.AG)multiprojective spacesMathematicsDiscrete mathematicsMathematics::Commutative AlgebraLinkageArithmetically Cohen-Macaulay Linkage Points in multiprojective spacesApplied Mathematics010102 general mathematicsExtension (predicate logic)Mathematics - Commutative AlgebraArithmetically Cohen-MacaulaypointsSettore MAT/02 - Algebracohen- macaulay multiprojective spaces points010307 mathematical physicsSettore MAT/03 - Geometria
researchProduct

A C1-generic dichotomy for diffeomorphisms: Weak forms of hyperbolicity or infinitely many sinks or sources

2003

We show that, for every compact n-dimensional manifold, n > 1, there is a residual subset of Diff (M) of diffeomorphisms for which the homoclinic class of any periodic saddle of f verifies one of the following two possibilities: Either it is contained in the closure of an infinite set of sinks or sources (Newhouse phenomenon), or it presents some weak form of hyperbolicity called dominated splitting (this is a generalization of a bidimensional result of Mafine [Ma3]). In particular, we show that any Cl-robustly transitive diffeomorphism admits a dominated splitting.

Pure mathematicsClass (set theory)Infinite setMathematics::Dynamical SystemsGeneralizationMathematical analysisClosure (topology)ManifoldMathematics (miscellaneous)DiffeomorphismHomoclinic orbitStatistics Probability and UncertaintySaddleMathematicsAnnals of Mathematics
researchProduct

A characterization of regular circular languages generated by marked splicing systems

2009

AbstractSplicing systems are generative devices of formal languages, introduced by Head in 1987 to model biological phenomena on linear and circular DNA molecules. A splicing system is defined by giving an initial set I and a set R of rules. Some unanswered questions are related to the computational power of circular splicing systems. In particular, a still open question is to find a characterization of circular languages generated by finite circular splicing systems (i.e., circular splicing systems with both I and R finite sets). In this paper we introduce a special class of the latter systems named marked systems. We prove that a marked system S generates a regular circular language if an…

Pure mathematicsGeneral Computer ScienceMolecular computing Splicing systems Circular words Formal languages Automata theoryMolecular computingQuantitative Biology::GenomicsDecidabilityTheoretical Computer ScienceSet (abstract data type)Formal languagesRegular languageFormal languageRNA splicingAutomata theorySplicing systemsCircular wordsFinite setAlgorithmWord (computer architecture)Automata theoryMathematicsComputer Science(all)
researchProduct

Multidimensional Borg–Levinson theorems for unbounded potentials

2018

We prove that the Dirichlet eigenvalues and Neumann boundary data of the corresponding eigenfunctions of the operator $-\Delta + q$, determine the potential $q$, when $q \in L^{n/2}(\Omega,\mathbb{R})$ and $n \geq 3$. We also consider the case of incomplete spectral data, in the sense that the above spectral data is unknown for some finite number of eigenvalues. In this case we prove that the potential $q$ is uniquely determined for $q \in L^p(\Omega,\mathbb{R})$ with $p=n/2$, for $n\geq4$ and $p>n/2$, for $n=3$.

Pure mathematicsGeneral MathematicsOperator (physics)010102 general mathematicsMathematics::Spectral TheoryEigenfunction01 natural sciencesOmega010101 applied mathematicsDirichlet eigenvalueBoundary data0101 mathematicsSpectral dataFinite setEigenvalues and eigenvectorsMathematicsAsymptotic Analysis
researchProduct

Some basic theorems on the foundations of mathematics and their philosophical implications

1995

Research in the foundations of mathematics during the past few decades has produced some results, which seem to me of interest, not only in themselves, but also with regard to their implications for the traditional philosophical problems about the nature of mathematics. The results themselves, I believe, are fairly widely known, but nevertheless, I think, it will be useful to present them in outline once again, especially in view of the fact that, due to the work of various mathematicians, they have taken on a much more satisfactory form, than they had had originally. The greatest improvement was made possible through the precise definition of the concept of finite procedure, which plays a …

Pure mathematicsNoticeTuringcomputerFinite setFoundations of mathematicscomputer.programming_languageMathematicsEpistemology
researchProduct