Search results for "Mathematica"
showing 10 items of 7971 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.
On the Existence of 1-Bounded Bi-ideals with the WELLDOC Property
2015
A combinatorial condition called well distributedoccurrences, or WELLDOC for short, has been introducedrecently. The proofs that WELLDOC property holds for thefamily of Sturmian words, and more generally, for Arnoux-Rauzy words are given in two papers by Balkova et al. The WELLDOC property for bounded bi-ideals is analysed inthis paper. The existence of a 1-bounded bi-ideal over thefinite alphabet that satisfies the WELLDOC property has beenproved by the authors.
Finite 2-groups with odd number of conjugacy classes
2016
In this paper we consider finite 2-groups with odd number of real conjugacy classes. On one hand we show that if $k$ is an odd natural number less than 24, then there are only finitely many finite 2-groups with exactly $k$ real conjugacy classes. On the other hand we construct infinitely many finite 2-groups with exactly 25 real conjugacy classes. Both resuls are proven using pro-$p$ techniques and, in particular, we use the Kneser classification of semi-simple $p$-adic algebraic groups.
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.
Exact, efficient, and complete arrangement computation for cubic curves
2006
AbstractThe Bentley–Ottmann sweep-line method can compute the arrangement of planar curves, provided a number of geometric primitives operating on the curves are available. We discuss the reduction of the primitives to the analysis of curves and curve pairs, and describe efficient realizations of these analyses for planar algebraic curves of degree three or less. We obtain a complete, exact, and efficient algorithm for computing arrangements of cubic curves. Special cases of cubic curves are conics as well as implicitized cubic splines and Bézier curves.The algorithm is complete in that it handles all possible degeneracies such as tangential intersections and singularities. It is exact in t…
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…
A Unifying Approach to Weyl Type Theorems for Banach Space Operators
2013
Weyl type theorems have been proved for a considerably large number of classes of operators. In this paper, by introducing the class of quasi totally hereditarily normaloid operators, we obtain a theoretical and general framework from which Weyl type theorems may be promptly established for many of these classes of operators. This framework also entails Weyl type theorems for perturbations f(T + K), where K is algebraic and commutes with T, and f is an analytic function, defined on an open neighborhood of the spectrum of T + K, such that f is non constant on each of the components of its domain.
On the existence of conditionally invariant probability measures in dynamical systems
2000
Let T : X→X be a measurable map defined on a Polish space X and let Y be a non-trivial subset of X. We give conditions ensuring the existence of conditionally invariant probability measures to non-absorption in Y. For dynamics which are non-singular with respect to some fixed probability measure we supply sufficient conditions for the existence of absolutely continuous conditionally invariant measures. These conditions are satisfied for a wide class of dynamical systems including systems that are Φ-mixing and Gibbs.
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.