Search results for "Finite set"
showing 10 items of 101 documents
Word assembly through minimal forbidden words
2006
AbstractWe give a linear-time algorithm to reconstruct a finite word w over a finite alphabet A of constant size starting from a finite set of factors of w verifying a suitable hypothesis. We use combinatorics techniques based on the minimal forbidden words, which have been introduced in previous papers. This improves a previous algorithm which worked under the assumption of stronger hypothesis.
The $p\lambda n$ fractal decomposition: Nontrivial partitions of conserved physical quantities
2015
A mathematical method for constructing fractal curves and surfaces, termed the $p\lambda n$ fractal decomposition, is presented. It allows any function to be split into a finite set of fractal discontinuous functions whose sum is equal everywhere to the original function. Thus, the method is specially suited for constructing families of fractal objects arising from a conserved physical quantity, the decomposition yielding an exact partition of the quantity in question. Most prominent classes of examples are provided by Hamiltonians and partition functions of statistical ensembles: By using this method, any such function can be decomposed in the ordinary sum of a specified number of terms (g…
A fixed point theorem for G-monotone multivalued mapping with application to nonlinear integral equations
2017
We extend notion and theorem of [21] to the case of a multivalued mapping defined on a metric space endowed with a finite number of graphs. We also construct an example to show the generality of our result over existing results. Finally, we give an application to nonlinear integral equations
On the maximal superalgebras of supersymmetric backgrounds
2009
17 pages.-- ISI article identifier:000262585300016.-- ArXiv pre-print avaible at:http://arxiv.org/abs/0809.5034
INDUCTIVE INFERENCE OF LIMITING PROGRAMS WITH BOUNDED NUMBER OF MIND CHANGES
1996
We consider inductive inference of total recursive functions in the case, when produced hypotheses are allowed some finite number of times to change “their mind” about each value of identifiable function. Such type of identification, which we call inductive inference of limiting programs with bounded number of mind changes, by its power lies somewhere between the traditional criteria of inductive inference and recently introduced inference of limiting programs. We consider such model of inductive inference for EX and BC types of identification, and we study • tradeoffs between the number of allowed mind changes and the number of anomalies, and • relations between classes of functions ident…
Toward a formalization of a two traders market with information exchange
2014
This paper shows that Hamiltonians and operators can also be put to good use even in contexts which are not purely physics based. Consider the world of finance. The work presented here {models a two traders system with information exchange with the help of four fundamental operators: cash and share operators; a portfolio operator and an operator reflecting the loss of information. An information Hamiltonian is considered and an additional Hamiltonian is presented which reflects the dynamics of selling/buying shares between traders. An important result of the paper is that when the information Hamiltonian is zero, portfolio operators commute with the Hamiltonian and this suggests that the dy…
First passage time distribution of stationary Markovian processes
2010
The aim of this paper is to investigate how the correlation properties of a stationary Markovian stochastic processes affect the First Passage Time distribution. First Passage Time issues are a classical topic in stochastic processes research. They also have relevant applications, for example, in many fields of finance such as the assessment of the default risk for firms' assets. By using some explicit examples, in this paper we will show that the tail of the First Passage Time distribution crucially depends on the correlation properties of the process and it is independent from its stationary distribution. When the process includes an infinite set of time-scales bounded from above, the FPT…
Khovanov homology for signed divides
2009
The purpose of this paper is to interpret polynomial invariants of strongly invertible links in terms of Khovanov homology theory. To a divide, that is a proper generic immersion of a finite number of copies of the unit interval and circles in a [math] –disc, one can associate a strongly invertible link in the [math] –sphere. This can be generalized to signed divides: divides with [math] or [math] sign assignment to each crossing point. Conversely, to any link [math] that is strongly invertible for an involution [math] , one can associate a signed divide. Two strongly invertible links that are isotopic through an isotopy respecting the involution are called strongly equivalent. Such isotopi…
Constructing a Pareto front approximation for decision making
2011
An approach to constructing a Pareto front approximation to computationally expensive multiobjective optimization problems is developed. The approximation is constructed as a sub-complex of a Delaunay triangulation of a finite set of Pareto optimal outcomes to the problem. The approach is based on the concept of inherent nondominance. Rules for checking the inherent nondominance of complexes are developed and applying the rules is demonstrated with examples. The quality of the approximation is quantified with error estimates. Due to its properties, the Pareto front approximation works as a surrogate to the original problem for decision making with interactive methods. Qc 20120127
MUTUAL INDUCTANCE FOR AN EXPLICITLY FINITE NUMBER OF TURNS
2011
Non coaxial mutual inductance calculations, based on a Bessel function formulation, are presented for coils modelled by an explicitly flnite number of circular turns. The mutual inductance of two such turns can be expressed as an integral of a product of three Bessel functions and an exponential factor, and it is shown that the exponential factors can be analytically summed as a simple geometric progression, or other related sums. This allows the mutual inductance of two thin solenoids to be expressed as an integral of a single analytical expression. Sample numerical results are given for some representative cases and the approach to the limit where the turns are considered to be smeared ou…