Results 31 to 40 of about 4,979,723 (296)
A forbidden set for embedded eigenvalues [PDF]
Proceedings of the American Mathematical Society, 1994 We study the problem of embedding eigenvalues to the spectrum of a Sturm-Liouville operator in the half axis when this spectrum is a perfect set. We prove the existence of an uncountable dense subset of the spectrum for which, by modifying the condition at the left or by locally perturbing the potential, it is not possible to add any eigenvalues.
openaire +2 more sources
Global Behavior of Two Rational Third Order Difference Equations
Universal Journal of Mathematics and Applications, 2019 In this paper, we solve and study the global behavior of all admissible solutions of the two difference equations $$x_{n+1}=\frac{x_{n}x_{n-2}}{x_{n-1}-x_{n-2}}, \quad n=0,1,...,$$ and $$x_{n+1}=\frac{x_{n}x_{n-2}}{-x_{n-1}+x_{n-2}}, \quad n=0,1 ...
R. Abo-zeid, H. Kamal
doaj +1 more source
Set families with forbidden subposets
Journal of Combinatorial Theory, Series A, 2015 16 pages, 1 ...
Linyuan Lu, Kevin G. Milans
openaire +3 more sources
Nodal Sets of Schrödinger Eigenfunctions in Forbidden Regions [PDF]
Annales Henri Poincaré, 2016 This note concerns the nodal sets of eigenfunctions of semiclassical Schrödinger operators acting on compact, smooth, Riemannian manifolds, with no boundary. We prove that if H is a separating hypersurface that lies inside the classically forbidden region, then H cannot persist as a component of the zero set of infinitely many eigenfunctions.
Canzani, Yaiza, Toth, John A.
openaire +2 more sources
Constructing strings avoiding forbidden substrings [PDF]
, 2021 We consider the problem of constructing strings over an alphabet Σ that start with a given prefix u, end with a given suffix v, and avoid occurrences of a given set of forbidden substrings.
Sweering, Michelle +6 more
core +5 more sources
Behavior of solutions of a second order rational difference equation [PDF]
Mathematica Moravica, 2019 In this paper, we solve the difference equation xn+1 = α xnxn-1 - 1 , n = 0, 1, . . . , where α > 0 and the initial values x-1, x0 are real numbers. We find some invariant sets and discuss the global behavior of the solutions of that equation.
Abo-Zeid Raafat
doaj
Extending the MAX Algorithm for Maximum Independent Set
Discussiones Mathematicae Graph Theory, 2015 The maximum independent set problem is an NP-hard problem. In this paper, we consider Algorithm MAX, which is a polynomial time algorithm for finding a maximal independent set in a graph G.
Lê Ngoc C. +2 more
doaj +1 more source
On the solutions of a second order difference equation [PDF]
Mathematica Moravica, 2017 In this paper, we discuss the global behavior of all solutions of the difference equation Xn+1 = XnXn-1 axn + bxn-1, n € N0, where a; b are real numbers and the initial conditions X-1, X0 are real numbers.
Abo-Zeid R.
doaj
Permitted and Forbidden Sets in Symmetric Threshold-Linear Networks [PDF]
Neural Computation, 2003 The richness and complexity of recurrent cortical circuits is an inexhaustible source of inspiration for thinking about high-level biological computation. In past theoretical studies, constraints on the synaptic connection patterns of threshold-linear networks were found that guaranteed bounded network dynamics, convergence to attractive fixed points,
Richard H. R. Hahnloser +2 more
openaire +2 more sources
“rsppfp”: An R package for the shortest path problem with forbidden paths
SoftwareX, 2019 The Shortest Path Problem with Forbidden Paths (SPPFP) is a variant of the original shortest path problem, where the constraints come from a set of forbidden arc sequences that cannot be part of any feasible solution.
Melina Vidoni, Aldo Vecchietti
doaj +1 more source