Search results for "equation"

showing 10 items of 4219 documents

Zur Existenz von Lösungen gewisser Randwertaufgaben

1971

With the aid of some known results about integral equations of the Hammerstein type there is proofed an existence theorem for the following class of boundary value problems−y″−l 2 y′=f(x,y),y(a)=y(b)=0,l 2>0 mit|f(x, y)|=0,l 3 (x)>0. The existence range is determined by the greatest eigenvalue of some linear problem.

CombinatoricsApplied MathematicsGeneral MathematicsMathematical analysisLinear problemGeneral Physics and AstronomyExistence theoremIntegral equationBoundary valuesEigenvalues and eigenvectorsMathematicsZeitschrift für angewandte Mathematik und Physik ZAMP
researchProduct

On the Second Order Rational Difference Equation $$x_{n+1}=\beta +\frac{1}{x_n x_{n-1}}$$ x n + 1 = β + 1 x n x n - 1

2016

The author investigates the local and global stability character, the periodic nature, and the boundedness of solutions of the second-order rational difference equation $$x_{n+1}=\beta +\frac{1}{x_{n}x_{n-1}}, \quad n=0,1,\ldots ,$$ with parameter \(\beta \) and with arbitrary initial conditions such that the denominator is always positive. The main goal of the paper is to confirm Conjecture 8.1 and to solve Open Problem 8.2 stated by A.M. Amleh, E. Camouzis and G. Ladas in On the Dynamics of a Rational Difference Equations I (International Journal of Difference Equations, Volume 3, Number 1, 2008, pp.1–35).

CombinatoricsCharacter (mathematics)ConjectureRational difference equationOpen problemMathematical analysisOrder (ring theory)Beta (velocity)Mathematics
researchProduct

Construction of 3D Triangles on Dupin Cyclides

2011

This paper considers the conversion of the parametric Bézier surfaces, classically used in CAD-CAM, into patched of a class of non-spherical degree 4 algebraic surfaces called Dupin cyclides, and the definition of 3D triangle with circular edges on Dupin cyclides. Dupin cyclides was discovered by the French mathematician Pierre-Charles Dupin at the beginning of the 19th century. A Dupin cyclide has one parametric equation, two implicit equations, and a set of circular lines of curvature. The authors use the properties of these surfaces to prove that three families of circles (meridian arcs, parallel arcs, and Villarceau circles) can be computed on every Dupin cyclide. A geometric algorithm …

CombinatoricsClass (set theory)Degree (graph theory)Algebraic surfaceDupin cyclideBézier curveMathematics::Differential GeometryParametric equationCurvatureVillarceau circlesMathematicsInternational Journal of Computer Vision and Image Processing
researchProduct

Parabolic Equations Minimizing Linear Growth Functionals: L1-Theory

2004

Let Ω be a bounded set in ℝN with boundary of class C1. We are interested in the problem $$ \left\{ \begin{gathered} \frac{{\partial u}} {{\partial t}} = diva\left( {x,Du} \right)in Q = \left( {0,\infty } \right) \times \Omega , \hfill \\ u\left( {t,x} \right) = \phi \left( x \right)on S = \left( {0,\infty } \right) \times \partial \Omega , \hfill \\ u\left( {0,x} \right) = u_0 \left( x \right)in x \in \Omega \hfill \\ \end{gathered} \right. $$ (1) where ϕ ∈ L1(∂Ω), u0 ∈ L2(Ω) and a(x, ξ) = ∇ξ f(x, ξ, f being a function with linear growth in ‖ξ‖ as ‖ξ‖ → ∞. One of the classical examples is the nonparametric area integrand for which \( f(x,\xi ) = \sqrt {1 + \left\| \xi \right\|^2 } \). Prob…

CombinatoricsDirichlet problemPhysicssymbols.namesakeMinimal surfacesymbolsLinear growthParabolic partial differential equationOmegaLagrangian
researchProduct

On a Linear Diophantine Problem of Frobenius: Extending the Basis

1998

LetXk={a1, a2, …, ak},k>1, be a subset of N such that gcd(Xk)=1. We shall say that a natural numbernisdependent(onXk) if there are nonnegative integersxisuch thatnhas a representationn=∑ki=1 xiai, elseindependent. The Frobenius numberg(Xk) ofXkis the greatest integer withnosuch representation. Selmer has raised the problem of extendingXkwithout changing the value ofg. He showed that under certain conditions it is possible to add an elementc=a+kdto the arithmetic sequencea,a+d,a+2d, …, a+(k−1) d, gcd(a, d)=1, without alteringg. In this paper, we give the setCof all independent numberscsatisfyingg(A, c)=g(A), whereAcontains the elements of the arithmetic sequence. Moreover, ifa>kthen we give …

CombinatoricsDiscrete mathematicsAlgebra and Number TheoryCardinalityIntegerDiophantine equationArithmetic progressionValue (computer science)Basis (universal algebra)Element (category theory)MathematicsJournal of Number Theory
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

Span programs for functions with constant-sized 1-certificates

2012

Besides the Hidden Subgroup Problem, the second large class of quantum speed-ups is for functions with constant-sized 1-certificates. This includes the OR function, solvable by the Grover algorithm, the element distinctness, the triangle and other problems. The usual way to solve them is by quantum walk on the Johnson graph. We propose a solution for the same problems using span programs. The span program is a computational model equivalent to the quantum query algorithm in its strength, and yet very different in its outfit. We prove the power of our approach by designing a quantum algorithm for the triangle problem with query complexity O(n35/27) that is better than O(n13/10) of the best p…

CombinatoricsDiscrete mathematicsGrover's algorithmQuantum phase estimation algorithmSimon's problemQuantum walkQuantum algorithmQuantum algorithm for linear systems of equationsMathematicsQuantum complexity theoryQuantum computerProceedings of the forty-fourth annual ACM symposium on Theory of computing
researchProduct

Fractional master equations and fractal time random walks

1995

Fractional master equations containing fractional time derivatives of order 0\ensuremath{\le}1 are introduced on the basis of a recent classification of time generators in ergodic theory. It is shown that fractional master equations are contained as a special case within the traditional theory of continuous time random walks. The corresponding waiting time density \ensuremath{\psi}(t) is obtained exactly as \ensuremath{\psi}(t)=(${\mathit{t}}^{\mathrm{\ensuremath{\omega}}\mathrm{\ensuremath{-}}1}$/C)${\mathit{E}}_{\mathrm{\ensuremath{\omega}},\mathrm{\ensuremath{\omega}}}$(-${\mathit{t}}^{\mathrm{\ensuremath{\omega}}}$/C), where ${\mathit{E}}_{\mathrm{\ensuremath{\omega}},\mathrm{\ensuremat…

CombinatoricsDistribution (mathematics)FractalMaster equationErgodic theoryOrder (ring theory)Function (mathematics)Random walkOmegaMathematicsPhysical Review E
researchProduct

Periodic Solutions of the Second Order Quadratic Rational Difference Equation $$x_{n+1}=\frac{\alpha }{(1+x_n)x_{n-1}} $$ x n + 1 = α ( 1 + x n ) x n…

2016

The aim of this article is to investigate the periodic nature of solutions of a rational difference equation $$x_{n+1}=\frac{\alpha }{(1+x_n)x_{n-1}}. {(*)} $$ We explore Open Problem 3.3 given in Amleh et al. (Int J Differ Equ 3(1):1–35, 2008, [2]) that requires to determine all periodic solutions of the equation (*). We conclude that for the equation (*) there are no periodic solution with prime period 3 and 4. Period 7 is first period for which exists nonnegative parameter \(\alpha \) and nonnegative initial conditions.

CombinatoricsEquilibrium pointQuadratic equationRational difference equationPeriod (periodic table)Differential equationOpen problemMathematical analysisOrder (ring theory)Prime (order theory)Mathematics
researchProduct

The constant osculating rank of the Wilking manifold

2008

We prove that the osculating rank of the Wilking manifold V3 = (SO (3) × SU (3)) / U• (2), endowed with the metric over(g, )1, equals 2. The knowledge of the osculating rank allows us to solve the differential equation of the Jacobi vector fields. These results can be applied to determine the area and the volume of geodesic spheres and balls. To cite this article: E. Macias-Virgos et al., C. R. Acad. Sci. Paris, Ser. I 346 (2008). © 2007 Academie des sciences.

CombinatoricsGeodesicDifferential equationMathematical analysisMetric (mathematics)Vector fieldGeneral MedicineRank (differential topology)Constant (mathematics)ManifoldMathematicsOsculating circleComptes Rendus Mathematique
researchProduct