Search results for "Predicate logic"

Eigenvalues of non-hermitian matrices: a dynamical and an iterative approach. Application to a truncated Swanson model

2020

We propose two different strategies to find eigenvalues and eigenvectors of a given, not necessarily Hermitian, matrix (Formula presented.). Our methods apply also to the case of complex eigenvalues, making the strategies interesting for applications to physics and to pseudo-Hermitian quantum mechanics in particular. We first consider a dynamical approach, based on a pair of ordinary differential equations defined in terms of the matrix (Formula presented.) and of its adjoint (Formula presented.). Then, we consider an extension of the so-called power method, for which we prove a fixed point theorem for (Formula presented.) useful in the determination of the eigenvalues of (Formula presented…

On the Cauchy problem for microlocally symmetrizable hyperbolic systems with log-Lipschitz coefficients

2017

International audience; The present paper concerns the well-posedness of the Cauchy problem for microlocally symmetrizable hyperbolic systems whose coefficients and symmetrizer are log-Lipschitz continuous, uniformly in time and space variables. For the global in space problem we establish energy estimates with finite loss of derivatives, which is linearly increasing in time. This implies well-posedness in H ∞ , if the coefficients enjoy enough smoothness in x. From this result, by standard arguments (i.e. extension and convexification) we deduce also local existence and uniqueness. A huge part of the analysis is devoted to give an appropriate sense to the Cauchy problem, which is not evide…

Cyclic (noncyclic) phi-condensing operator and its application to a system of differential equations

2019

We establish a best proximity pair theorem for noncyclic φ-condensing operators in strictly convex Banach spaces by using a measure of noncompactness. We also obtain a counterpart result for cyclic φ-condensing operators in Banach spaces to guarantee the existence of best proximity points, and so, an extension of Darbo’s fixed point theorem will be concluded. As an application of our results, we study the existence of a global optimal solution for a system of ordinary differential equations.

Quasiextremal distance domains and extension of quasiconformal mappings

1985

On the stability of the localized single-valued extension property under commuting perturbations

2013

This article concerns the permanence of the single-valued extension property at a point under suitable perturbations. While this property is, in general, not preserved under sums and products of commuting operators, we obtain positive results in the case of commuting perturbations that are quasi-nilpotent, algebraic, or Riesz operators.

An Extension of Weyl’s Equidistribution Theorem to Generalized Polynomials and Applications

2020

Author's accepted manuscript. This is a pre-copyedited, author-produced version of an article accepted for publication in International Mathematics Research Notices following peer review. The version of record Bergelson, V., Knutson, I. J. H. & Son, Y. (2020). An Extension of Weyl’s Equidistribution Theorem to Generalized Polynomials and Applications. International Mathematics Research Notices, 2021(19), 14965-15018 is available online at: https://academic.oup.com/imrn/article/2021/19/14965/5775499 and https://doi.org/10.1093/imrn/rnaa035. Generalized polynomials are mappings obtained from the conventional polynomials by the use of the operations of addition and multiplication and taking th…

Binary Patterns in Infinite Binary Words

2002

In this paper we study the set P(w) of binary patterns that can occur in one infinite binary word w, comparing it with the set F(w) of factors of the word. Since the set P(w) can be considered as an extension of the set F(w), we first investigate how large is such extension, by introducing the parameter ?(w) that corresponds to the cardinality of the difference set P(w) \ F(w). Some non trivial results about such parameter are obtained in the case of the Thue-Morse and the Fibonacci words. Since, in most cases, the parameter ?(w) is infinite, we introduce the pattern complexity of w, which corresponds to the complexity of the language P(w). As a main result, we prove that there exist infini…

Attracting sets in a deterministic discrete traffic model

2001

The fundamental diagram of the Nagel-Schreckenberg traffic model is derived analytically for the deterministic case using methods and concepts from nonlinear dynamics. It is shown that the possible states of the long-term behaviour form a globally attractive subset which can be well characterized. This attractive set of states is composed of coexisting attractors. The attractor concept is applied to a slow-to-start extension of the model. For this example it is shown that the attractive set consists of coexisting attractors with different macroscopic properties, that can be determined analytically.

A High Level Language for Pyramidal Architectures

1986

In the paper are described the syntax and some implementation features of a high level language for pyramidal architectures called Pyramid B Language (PCL). The language is an extension of the B and include data type, set of instructions and builtin functions oriented to the pyramidal architectures. Some notes on the implementation for the PAPIA machine are also given.

Quasi conjunction and p-entailment in nonmonotonic reasoning

2010

We study, in the setting of coherence, the extension of a probability assessment defined on n conditional events to their quasi conjunction. We consider, in particular, two special cases of logical dependencies; moreover, we examine the relationship between the notion of p-entailment of Adams and the inclusion relation of Goodman and Nguyen. We also study the probabilistic semantics of the QAND rule of Dubois and Prade; then, we give a theoretical result on p-entailment.