2,650 research outputs found
Decompositions of Nakano norms by ODE techniques
We study decompositions of Nakano type varying exponent Lebesgue norms and
spaces. These function spaces are represented here in a natural way as
tractable varying sums of projection bands. The main results involve
embedding the varying Lebesgue spaces to such sums, as well as the
corresponding isomorphism constants. The main tool applied here is an
equivalent variable Lebesgue norm which is defined by a suitable ordinary
differential equation introduced recently by the author. We also analyze the
effect of transformations changing the ordering of the unit interval on the
values of the ODE-determined norm
Using qualitative reasoning in modelling consensus in group decision-making
Ordinal scales are commonly used in rating and evaluation processes. These processes usually involve group decision making by means of an experts’ committee. In this paper a mathematical framework based on the qualitative model of the absolute orders of magnitude is considered. The entropy of a qualitatively described system is defined in this framework.
On the one hand, this enables us to measure the amount of information provided by each evaluator and, on the other hand, the coherence of the evaluation committee. The new approach is capable of managing situations where the assessment given by experts involves different levels of precision.
The use of the proposed measures within an automatic system for group decision making will contribute towards avoiding the potential subjectivity caused by conflicts of interests of the evaluators in the group.Postprint (published version
Potts Model Partition Functions for Self-Dual Families of Strip Graphs
We consider the -state Potts model on families of self-dual strip graphs
of the square lattice of width and arbitrarily great length ,
with periodic longitudinal boundary conditions. The general partition function
and the T=0 antiferromagnetic special case (chromatic polynomial) have
the respective forms , with . For arbitrary , we determine (i)
the general coefficient in terms of Chebyshev polynomials, (ii)
the number of terms with each type of coefficient, and (iii) the
total number of terms . We point out interesting connections
between the and Temperley-Lieb algebras, and between the
and enumerations of directed lattice animals. Exact
calculations of are presented for . In the limit of
infinite length, we calculate the ground state degeneracy per site (exponent of
the ground state entropy), . Generalizing from to
, we determine the continuous locus in the complex
plane where is singular. We find the interesting result that for all
values considered, the maximal point at which crosses the real
axis, denoted is the same, and is equal to the value for the infinite
square lattice, . This is the first family of strip graphs of which we
are aware that exhibits this type of universality of .Comment: 36 pages, latex, three postscript figure
A framework for semiqualitative reasoning in engineering applications
In most cases the models for experimentation, analysis, or design in engineering applications
take into account only quantitative knowledge. Sometimes there is a qualitative knowledge
that is convenient to consider in order to obtain better conclusions. These qualitative concepts
can be labels such as ``high,’ ’ ``very negative,’ ’ ``little acid,’ ’ ``monotonically increasing’ ’
or
symbols such as ¾; º, etc. . . Engineers have already used this type of knowledge implicitly
in many activities. The framework that we present here lets us express explicitly this
knowledge.
This work makes the following contributions. First, we identify the most important classes
of qualitative concepts in engineering activities. Second, we present a novel methodology to
integrate both qualitative and quantitative knowledge. Third, we obtain signi®
cant conclusions automatically. It is named semiqualitative reasoning.
Qualitative concepts are represented by means of closed real intervals. This
approximation is accepted in the area of Arti® cial Intelligence. A modeling language
is speci® ed to represent qualitative and quantitative knowledge of the model. A
numeric constraint satisfaction problem is obtained by means of corresponding
rules of transformation of the semantics of this language. In order to obtain conclusions,
we have developed algorithms that treat the problem in a symbolic and numeric way. The
interval conclusions obtained are transformed into qualitative labels through a
linguistic interpretation. Finally, the capabilities of this methodology are illustrated on
different problems
- …