Search results for "CALL"
showing 10 items of 2320 documents
On the weight distribution of perfect binary codes
2021
In this paper, we give a new proof of the closed-form formula for the weight distribution of a perfect binary single-error-correcting code.
Some results concerning simple locally finite groups of 1-type
2005
AbstractIn this paper several aspects of infinite simple locally finite groups of 1-type are considered. In the first part, the classes of diagonal limits of finite alternating groups, of diagonal limits of finite direct products of alternating groups, and of absolutely simple groups of 1-type are distinguished from each other. In the second part, inductive systems of representations over fields of characteristic zero (which are known to correspond to ideals in the group algebra) are studied in general for groups of 1-type. The roles of primitive respectively imprimitive representations in inductive systems are investigated. Moreover it is shown that in any proper inductive system the depth…
The overlap algebra of regular opens
2010
Abstract Overlap algebras are complete lattices enriched with an extra primitive relation, called “overlap”. The new notion of overlap relation satisfies a set of axioms intended to capture, in a positive way, the properties which hold for two elements with non-zero infimum. For each set, its powerset is an example of overlap algebra where two subsets overlap each other when their intersection is inhabited. Moreover, atomic overlap algebras are naturally isomorphic to the powerset of the set of their atoms. Overlap algebras can be seen as particular open (or overt) locales and, from a classical point of view, they essentially coincide with complete Boolean algebras. Contrary to the latter, …
Radó-Kneser-Choquet Theorem for simply connected domains (p-harmonic setting)
2018
A remarkable result known as Rad´o-Kneser-Choquet theorem asserts that the harmonic extension of a homeomorphism of the boundary of a Jordan domain ⌦ ⇢ R2 onto the boundary of a convex domain Q ⇢ R2 takes ⌦ di↵eomorphically onto Q . Numerous extensions of this result for linear and nonlinear elliptic PDEs are known, but only when ⌦ is a Jordan domain or, if not, under additional assumptions on the boundary map. On the other hand, the newly developed theory of Sobolev mappings between Euclidean domains and Riemannian manifolds demands to extend this theorem to the setting on simply connected domains. This is the primary goal of our article. The class of the p -harmonic equations is wide enou…
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.
Algorithmic Information Theory and Computational Complexity
2013
We present examples where theorems on complexity of computation are proved using methods in algorithmic information theory. The first example is a non-effective construction of a language for which the size of any deterministic finite automaton exceeds the size of a probabilistic finite automaton with a bounded error exponentially. The second example refers to frequency computation. Frequency computation was introduced by Rose and McNaughton in early sixties and developed by Trakhtenbrot, Kinber, Degtev, Wechsung, Hinrichs and others. A transducer is a finite-state automaton with an input and an output. We consider the possibilities of probabilistic and frequency transducers and prove sever…
Analytic Extension of Non Quasi - Analytic Whitney Jets of Beurling Type
1998
Let (Mr)r∈ℕ0 be a logarithmically convex sequence of positive numbers which verifies M0 = 1 as well as Mr ≥ 1 for every r ∈ ℕ and defines a non quasi - analytic class. Let moreover F be a closed proper subset of ℝn. Then for every function f on ℝn belonging to the non quasi - analytic (Mr)-class of Beurling type, there is an element g of the same class which is analytic on ℝ,nF and such that Dαf(x) = Dαg(x) for every α ∈ ℕn0 and x ∈ F.
On the Hierarchy Classes of Finite Ultrametric Automata
2015
This paper explores the language classes that arise with respect to the head count of a finite ultrametric automaton. First we prove that in the one-way setting there is a language that can be recognized by a one-head ultrametric finite automaton and cannot be recognized by any k-head non-deterministic finite automaton. Then we prove that in the two-way setting the class of languages recognized by ultrametric finite k-head automata is a proper subclass of the class of languages recognized by (k + 1)-head automata. Ultrametric finite automata are similar to probabilistic and quantum automata and have only just recently been introduced by Freivalds. We introduce ultrametric Turing machines an…
Querying the Guarded Fragment with Transitivity
2016
We study the problem of answering a union of Boolean conjunctive queries q against a database Δ, and a logical theory φ which falls in the guarded fragment with transitive guards (GF + TG). We trace the frontier between decidability and undecidability of the problem under consideration. Surprisingly, we show that query answering under GF2 + TG, i.e., the two-variable fragment of GF + TG, is already undecidable (even without equality), whereas its monadic fragment is decidable; in fact, it is 2exptime-complete in combined complexity and coNP-complete in data complexity. We also show that for a restricted class of queries, query answering under GF+TG is decidable. © 2013 Springer-Verlag.
Graph connectivity and monadic NP
2002
Ehrenfeucht games are a useful tool in proving that certain properties of finite structures are not expressible by formulas of a certain type. In this paper a new method is introduced that allows the extension of a local winning strategy for Duplicator, one of the two players in Ehrenfeucht games, to a global winning strategy. As an application it is shown that graph connectivity cannot be expressed by existential second-order formulas, where the second-order quantification is restricted to unary relations (monadic NP), even, in the presence of a built-in linear order. As a second application it is stated, that, on the other hand, the presence of a linear order increases the power of monadi…