Search results for "Existential quantification"
showing 10 items of 39 documents
A short proof of the self-improving regularity of quasiregular mappings
2005
. The theoryof quasiregular mappings is a central topic in modern analysis withimportant connections to a variety of topics as elliptic partial differen-tial equations, complex dynamics, differential geometry and calculus ofvariations [13] [10].A remarkable feature of quasiregular mappings is the self-improvingregularity. In 1957 [2], Bojarski proved that for planar quasiregularmappings, there exists an exponent
Some new Hadamard designs with 79 points admitting automorphisms of order 13 and 19
2001
Abstract We have proved that there exists at least 2091 mutually nonisomorphic symmetric (79,39,19)-designs. In particular, 1896 of them admit an action of the nonabelian group of order 57, and an additional 194 an action of the nonabelian group of order 39.
On Sets of Words of Rank Two
2019
Given a (finite or infinite) subset X of the free monoid A∗ over a finite alphabet A, the rank of X is the minimal cardinality of a set F such that X⊆ F∗. A submonoid M generated by k elements of A∗ is k-maximal if there does not exist another submonoid generated by at most k words containing M. We call a set X⊆ A∗ primitive if it is the basis of a |X|-maximal submonoid. This extends the notion of primitive word: indeed, w is a primitive set if and only if w is a primitive word. By definition, for any set X, there exists a primitive set Y such that X⊆ Y∗. The set Y is therefore called a primitive root of X. As a main result, we prove that if a set has rank 2, then it has a unique primitive …
Frequency Prediction of Functions
2012
Prediction of functions is one of processes considered in inductive inference. There is a "black box" with a given total function f in it. The result of the inductive inference machine F( ) is expected to be f(n+1). Deterministic and probabilistic prediction of functions has been widely studied. Frequency computation is a mechanism used to combine features of deterministic and probabilistic algorithms. Frequency computation has been used for several types of inductive inference, especially, for learning via queries. We study frequency prediction of functions and show that that there exists an interesting hierarchy of predictable classes of functions.
ADT implementation and completion by induction from examples
1991
There exists a fast algorithm [2] for inductive synthesis of terminating and ground confluent term rewriting systems from samples. The principles of this algorithm and the methodology of its use for implementation and completion of abstract data types are described.
The minimal model of Hahn for the Calvin cycle.
2018
There are many models of the Calvin cycle of photosynthesis in the literature. When investigating the dynamics of these models one strategy is to look at the simplest possible models in order to get the most detailed insights. We investigate a minimal model of the Calvin cycle introduced by Hahn while he was pursuing this strategy. In a variant of the model not including photorespiration it is shown that there exists exactly one positive steady state and that this steady state is unstable. For generic initial data either all concentrations tend to infinity at lates times or all concentrations tend to zero at late times. In a variant including photorespiration it is shown that for suitable v…
Optimal transport maps on Alexandrov spaces revisited
2018
We give an alternative proof for the fact that in $n$-dimensional Alexandrov spaces with curvature bounded below there exists a unique optimal transport plan from any purely $(n-1)$-unrectifiable starting measure, and that this plan is induced by an optimal map.
Failure of the local-to-global property for CD(K,N) spaces
2016
Given any K and N we show that there exists a compact geodesic metric measure space satisfying locally the CD(0,4) condition but failing CD(K,N) globally. The space with this property is a suitable non convex subset of R^2 equipped with the l^\infty-norm and the Lebesgue measure. Combining many such spaces gives a (non compact) complete geodesic metric measure space satisfying CD(0,4) locally but failing CD(K,N) globally for every K and N.
Nonexistence of Quasiconformal Maps Between Certain Metric Measure Spaces
2013
We provide new conditions that ensure that two metric measure spaces are not quasiconformally equivalent. As an application, we deduce that there exists no quasiconformal map between the sub-Riemannian Heisenberg and roto-translation groups.
A Note on the algebraic approach to the «almost» mean-field Heisenberg model
1993
We generalize to an «almost» mean-field Heisenberg model the algebraic approach already formulated for Ising models. We show that there exists a family of «relevant» states on which the algebraic dynamics αt can be defined. © 1993 Società Italiana di Fisica.