Search results for "5C"

showing 2 items of 72 documents

On a nonlinear Schrödinger equation for nucleons in one space dimension

2021

We study a 1D nonlinear Schrödinger equation appearing in the description of a particle inside an atomic nucleus. For various nonlinearities, the ground states are discussed and given in explicit form. Their stability is studied numerically via the time evolution of perturbed ground states. In the time evolution of general localized initial data, they are shown to appear in the long time behaviour of certain cases.

numerical studySpace dimensionNonlinear Schrö010103 numerical & computational mathematicsNonlinear Schrödinger equations01 natural sciencesStability (probability)symbols.namesakeMathematics - Analysis of PDEs[MATH.MATH-AP]Mathematics [math]/Analysis of PDEs [math.AP]Mathematics - Numerical Analysis0101 mathematics[MATH]Mathematics [math]dinger equationsNonlinear Schrödinger equationMathematicsMSC 35Q55 35C08 65M70Numerical AnalysisApplied Mathematics010102 general mathematicsTime evolutionground statesComputational MathematicsClassical mechanicsModeling and SimulationAtomic nucleussymbolsParticleNucleonAnalysis[MATH.MATH-NA]Mathematics [math]/Numerical Analysis [math.NA]
researchProduct

Extremal Irregular Digraphs

2018

A digraph is called irregular if its distinct vertices have distinct degree pairs. An irregular digraph is called minimal (maximal) if the removal of any arc (addition of any new arc) results in a non-irregular digraph. It is easily seen that the minimum sizes among irregular n-vertex whether digraphs or oriented graphs are the same and are asymptotic to (√2/3) n3/2; maximum sizes, however, are asymptotic to n2 and n2/2, respectively. Let s stand for the sum of initial positive integers, s = 1, 3, 6, . . . . An oriented graph Hs and a digraph Fs, both large (in terms of the size), minimal irregular, and on any such s vertices, s ≥ 21, are constructed in [Large minimal irregular digraphs, Op…

oriented graphApplied Mathematicsasymptotic sizeirregular digraphCombinatorics05c07minimal subdigraphQA1-939Discrete Mathematics and Combinatoricsmaximal subdigraph05c3505c30MathematicsMathematics05c20Discussiones Mathematicae Graph Theory
researchProduct