Nonlinear Nonhomogeneous Obstacle Problems with Multivalued Convection Term

In this paper, a nonlinear elliptic obstacle problem is studied. The nonlinear nonhomogeneous partial differential operator generalizes the notions of p-Laplacian while on the right hand side we have a multivalued convection term (i.e., a multivalued reaction term may depend also on the gradient of the solution). The main result of the paper provides existence of the solutions as well as bondedness and closedness of the set of weak solutions of the problem, under quite general assumptions on the data. The main tool of the paper is the surjectivity theorem for multivalued functions given by the sum of a maximal monotone multivalued operator and a bounded multivalued pseudomonotone one.

New dynamical features of pure k-essential cosmologies

We come back on the dynamical properties of [Formula: see text]-essential cosmological models and show how the interesting phenomenological features of those models are related to the existence of boundaries in the phase surface. We focus our attention to the branching curves where the energy density has an extremum and the effective speed of sound diverges. We discuss the behaviour of solutions of a general class of cosmological models exhibiting such curves and give two possible interpretations; the most interesting possibility regards the arrow of time that is reversed in trespassing the branching curve. This study teaches to us something new about general FLRW cosmologies where the fluids driving the cosmic evolution have equations of state that are multivalued functions of the energy density and other thermodynamical quantities.

Exponentials and Logarithms Properties in an Extended Complex Number Field

It is well established the complex exponential and logarithm are multivalued functions, both failing to maintain most identities originally valid over the positive integers domain. Moreover the general case of complex logarithm, with a complex base, is hardly mentionned in mathematic litterature. We study the exponentiation and logarithm as binary operations where all operands are complex. In a redefined complex number system using an extension of the C field, hereafter named E, we prove both operations always produce single value results and maintain the validity of identities such as logu (w v) = logu (w) + logu (v) where u, v, w in E. There is a cost as some algebraic properties of the addition and subtraction will be diminished, though remaining valid to a certain extent. In order to handle formulas in a C and E dual number system, we introduce the notion of set precision and set truncation. We show complex numbers as defined in C are insufficiently precise to grasp all subtleties of some complex operations, as a result multivaluation, identity failures and, in specific cases, wrong results are obtained when computing exclusively in C. A geometric representation of the new complex number system is proposed, in which the complex plane appears as an orthogonal projection, and where the complex logarithm an exponentiation can be simply represented. Finally we attempt an algebraic formalization of E.

Exponentials and Logarithms Properties in an Extended Complex Number Field

It is well established the complex exponential and logarithm are multivalued functions, both failing to maintain most identities originally valid over the positive integers domain. Moreover the general case of complex logarithm, with a complex base, is hardly mentionned in mathematic litterature. We study the exponentiation and logarithm as binary operations where all operands are complex. In a redefined complex number system using an extension of the C field, hereafter named E, we proove both operations always produce single value results and maintain the validity of identities such as logu (w v) = logu (w) + logu (v) where u, v, w in E. There is a cost as some algebraic properties of the addition and subtraction will be diminished, though remaining valid to a certain extent. In order to handle formulas in a C and E dual number system, we introduce the notion of set precision and set truncation. We show complex numbers as defined in C are insufficiently precise to grasp all subtleties of some complex operations, as a result multivaluation, identity failures and, in specific cases, wrong results are obtained when computing exclusively in C. A geometric representation of the new complex number system is proposed, in which the complex plane appears as an orthogonal projection, and where the complex logarithm an exponentiation can be simply represented. Finally we attempt an algebraic formalization of E.

Asymptotically periodic behavior of solutions to fractional non-instantaneous impulsive semilinear differential inclusions with sectorial operators

In this paper, we prove two results concerning the existence of S-asymptotically ω-periodic solutions for non-instantaneous impulsive semilinear differential inclusions of order $1<\alpha <2$ 1 < α < 2 and generated by sectorial operators. In the first result, we apply a fixed point theorem for contraction multivalued functions. In the second result, we use a compactness criterion in the space of bounded piecewise continuous functions defined on the unbounded interval $J=[0,\infty )$ J = [ 0 , ∞ ) . We adopt the fractional derivative in the sense of the Caputo derivative. We provide three examples illustrating how the results can be applied.

On one control problem with disturbance and vectograms depending linearly on given sets

A control problem with a given end time is considered, in which the control vectograms and disturbance depend linearly on the given convex compact sets. A multivalued mapping of the phase space of the control problem to the linear normed space E is given. The goal of constructing a control is that at the end of the control process the fixed vector of the space E belongs to the image of the multivalued mapping for any admissible realization of the disturbance. A stable bridge is defined in terms of multivalued functions. The presented procedure constructs, according to a given multivalued function which is a stable bridge, a control that solves the problem. Explicit formulas are obtained that determine a stable bridge in the considered control problem. Conditions are found under which the constructed stable bridge is maximal. Some problems of group pursuit can be reduced to the considered control problem with disturbance. The article provides such an example.

Incremental FPT Delay

In this paper, we study the relationship of parameterized enumeration complexity classes defined by Creignou et al. (MFCS 2013). Specifically, we introduce two hierarchies (IncFPTa and CapIncFPTa) of enumeration complexity classes for incremental fpt-time in terms of exponent slices and show how they interleave. Furthermore, we define several parameterized function classes and, in particular, introduce the parameterized counterpart of the class of nondeterministic multivalued functions with values that are polynomially verifiable and guaranteed to exist, TFNP, known from Megiddo and Papadimitriou (TCS 1991). We show that this class TF(para-NP), the restriction of the function variant of NP to total functions, collapsing to F(FPT), the function variant of FPT, is equivalent to the result that OutputFPT coincides with IncFPT. In addition, these collapses are shown to be equivalent to TFNP = FP, and also equivalent to P equals NP intersected with coNP. Finally, we show that these two collapses are equivalent to the collapse of IncP and OutputP in the classical setting. These results are the first direct connections of collapses in parameterized enumeration complexity to collapses in classical enumeration complexity, parameterized function complexity, classical function complexity, and computational complexity theory.

Una introducción al método de dominio colorado con GeoGebra para la visualización y estudio de funciones complejas

RESUMENExisten diversos métodos para visualizar funciones complejas, tales como graficar por separado sus componentes reales e imaginarios, mapear o transformar una región, el método de superficies analíticas y el método de dominio coloreado. Este último es uno de los métodos más recientes y aprovecha ciertas características del color y su procesamiento digital. La idea básica es usar colores, luminosidad y sombras como dimensiones adicionales, y para visualizar números complejos se usa una función real que asocia a cada número complejo un color determinado. El plano complejo puede entonces visualizarse como una paleta de colores construida a partir del esquema HSV (del inglés Hue, Saturation, Value – Matiz, Saturación, Valor). Como resultado, el método de dominio coloreado permite visualizar ceros y polos de funciones, ramas de funciones multivaluadas, el comportamiento de singularidades aisladas, entre otras propiedades. Debido a las características de GeoGebra en cuanto a los colores dinámicos, es posible implementar en el software el método de dominio coloreado para visualizar y estudiar funciones complejas, lo cual se explica en detalle en el presente artículo.Palabras claves: funciones complejas, método de dominio coloreado, colores dinámicos. RESUMOExistem vários métodos para visualizar funções complexas, como plotar seus componentes reais e imaginários separadamente, mapear ou transformar uma região, o método de superfície analítica e o método de domínio colorido. Este último é um dos métodos mais recentes e aproveita certas características da cor e seu processamento digital. A ideia básica é usar cores e brilho ou sombras como dimensões adicionais e, para visualizar números complexos, é usada uma função real que associa uma cor específica a cada número complexo. O plano complexo pode então ser visualizado como uma paleta de cores construída a partir do esquema HSV (de Matiz, Saturação, Valor - Matiz, Saturação, Valor). Como resultado, o método do domínio colorido permite visualizar zeros e pólos de funções, ramificações de funções com múltiplos valores, o comportamento de singularidades isoladas, entre outras propriedades. Devido às características do GeoGebra em termos de cores dinâmicas, é possível implementar o método do domínio colorido para visualizar e estudar funções complexas, o que é explicado em detalhes neste artigo.Palavras-chave: funções complexas, método de domínio colorido, cores dinâmicas ABSTRACTThere are various methods to visualize complex functions, such as plotting their real and imaginary components separately, mapping or transforming a region, the analytical landscapes method and the domain coloring method. The latter is one of the most recent methods and takes advantage of certain characteristics of color and its digital processing. The basic idea is to use colors and brightness or shadows as additional dimensions and to visualize complex numbers a real function is used that associates a specific color to each complex number. The complex plane can then be visualized as a color palette constructed from the HSV scheme (from Hue, Saturation, Value - Hue, Saturation, Value). As a result, the domain coloring method allows to visualize zeroes and poles of functions, branches of multivalued functions, the behavior of isolated singularities, among others properties. Due to the characteristics of GeoGebra in terms of dynamic colors, it is possible to implement the colored domain method to visualize and study complex functions, which is explained in detail in this article.Keywords: function; complex; domain; coloring.