Publication

Qualitative properties and global bifurcation of solutions for a singular boundary value problem

Related concepts (24)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Regular language

In theoretical computer science and formal language theory, a regular language (also called a rational language) is a formal language that can be defined by a regular expression, in the strict sense in theoretical computer science (as opposed to many modern regular expression engines, which are augmented with features that allow the recognition of non-regular languages). Alternatively, a regular language can be defined as a language recognized by a finite automaton.

Dialectical behavior therapy

Dialectical behavior therapy (DBT) is an evidence-based psychotherapy that began with efforts to treat personality disorders and interpersonal conflicts. Evidence suggests that DBT can be useful in treating mood disorders and suicidal ideation as well as for changing behavioral patterns such as self-harm and substance use. DBT evolved into a process in which the therapist and client work with acceptance and change-oriented strategies and ultimately balance and synthesize them—comparable to the philosophical dialectical process of thesis and antithesis, followed by synthesis.

Hamiltonian path problem

In the mathematical field of graph theory the Hamiltonian path problem and the Hamiltonian cycle problem are problems of determining whether a Hamiltonian path (a path in an undirected or directed graph that visits each vertex exactly once) or a Hamiltonian cycle exists in a given graph (whether directed or undirected). Both problems are NP-complete.

Singularity (mathematics)

In mathematics, a singularity is a point at which a given mathematical object is not defined, or a point where the mathematical object ceases to be well-behaved in some particular way, such as by lacking differentiability or analyticity. For example, the function has a singularity at , where the value of the function is not defined, as involving a division by zero. The absolute value function also has a singularity at , since it is not differentiable there. The algebraic curve defined by in the coordinate system has a singularity (called a cusp) at .