Search results for "Applied Mathematics"
showing 10 items of 4379 documents
Erratum to “Testing for selectivity in the dependence of random variables on external factors” [J. Math. Psych. 52 (2008) 128–144]
2010
Grundy coloring for power graphs
2003
International audience
Partially Square Graphs, Hamiltonicity and Circumference II
2000
Abstract Given a graph G, its partially square graph G∗ is a graph obtained by adding an edge uv for each pair u, v of vertices of G at distance 2 whenever the vertices u and v have a common neighbor x satisfying the condition NG(x) ⊆ NG[u] ∪ NG[v], where NG[x]= NG(x) ∪ {x}. In case G is a claw-free graph, G∗ is equal to G2, We define σ ∗ t = min{ ∑ x∈ d ∗ G (x): S is an independent set in G ∗ and ∣S∣ = t} , where d ∗ G (x) = ∣{y ∈ V∣ xy ∈ E(G∗)}∣ . We give for hamiltonicity and circumference new sufficient conditions depending on and we improve some known results.
Forbidden words in symbolic dynamics
2000
AbstractWe introduce an equivalence relation≃between functions from N to N. By describing a symbolic dynamical system in terms of forbidden words, we prove that the≃-equivalence class of the function that counts the minimal forbidden words of a system is a topological invariant of the system. We show that the new invariant is independent from previous ones, but it is not characteristic. In the case of sofic systems, we prove that the≃-equivalence of the corresponding functions is a decidable question. As a more special application, we show, by using the new invariant, that two systems associated to Sturmian words having “different slope” are not conjugate.
Regular Minimality and Thurstonian-type modeling
2009
Abstract A Thurstonian-type model for pairwise comparisons is any model in which the response (e.g., “they are the same” or “they are different”) to two stimuli being compared depends, deterministically or probabilistically, on the realizations of two randomly varying representations (perceptual images) of these stimuli. The two perceptual images in such a model may be stochastically interdependent but each has to be selectively dependent on its stimulus. It has been previously shown that all possible discrimination probability functions for same–different comparisons can be generated by Thurstonian-type models of the simplest variety, with independent percepts and deterministic decision ru…
Domains of accretive operators in Banach spaces
2016
LetD(A)be the domain of anm-accretive operatorAon a Banach spaceE. We provide sufficient conditions for the closure ofD(A)to be convex and forD(A)to coincide withEitself. Several related results and pertinent examples are also included.
A note on best approximation in 0-complete partial metric spaces
2014
We study the existence and uniqueness of best proximity points in the setting of 0-complete partial metric spaces. We get our results by showing that the generalizations, which we have to consider, are obtained from the corresponding results in metric spaces. We introduce some new concepts and consider significant theorems to support this fact.
Analysis of Optimal High Resolution and Fixed Rate Scalar Quantization
2009
In 2001, Hui and Neuhoff proposed a uniform quantizer with overload for the quantization of scalar signals and derived the asymptotically optimal size of the quantization bins in the high-bitrate limit. The purpose of the present paper is to prove a quantitatively more precise version of this result which, at the same time, is valid for a more general, quite natural class of probability distributions that requires only little regularity and includes, for instance, positive Lipschitz-continuous functions of unit integral.
On certain extension theorems in the mixed Borel setting
2004
Abstract Given two sequences M 1 and M 2 of positive numbers, we give necessary and sufficient conditions under which the inclusions Λ { M 1 } ⊂ f (j) (0) j∈ N 0 : f∈ D { M 2 } [−1,1] , Λ ( M 1 ) ⊂ f (j) (0) j∈ N 0 : f∈ D ( M 2 ) [−1,1] hold, by means of explicit constructions. This answers a question raised by Chaumat and Chollet (Math. Ann. 298 (1994) 7–40). We also consider the case when [−1,1] is replaced by [−1,1]m as well as the possibility to get ultraholomorphic extensions.
On the listing and random generation of hybrid binary trees
1994
We consider in this paper binary trees whose internal nodes are either associative or non-associative. Hybrid binary trees are equivalence classes with respect to the associative property. We count, list and generate randomly hybrid binary trees using Fibonacci numbers.