Search results for "Crete"

The variance of the $\ell _p^n$-norm of the Gaussian vector, and Dvoretzky’s theorem

2019

Fitting sets pairs

2000

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…

Infinite games and chain conditions

2015

We apply the theory of infinite two-person games to two well-known problems in topology: Suslin's Problem and Arhangel'skii's problem on $G_\delta$ covers of compact spaces. More specifically, we prove results of which the following two are special cases: 1) every linearly ordered topological space satisfying the game-theoretic version of the countable chain condition is separable and 2) in every compact space satisfying the game-theoretic version of the weak Lindel\"of property, every cover by $G_\delta$ sets has a continuum-sized subcollection whose union is $G_\delta$-dense.

Epichristoffel Words and Minimization of Moore Automata

2014

This paper is focused on the connection between the combinatorics of words and minimization of automata. The three main ingredients are the epichristoffel words, Moore automata and a variant of Hopcroft's algorithm for their minimization. Epichristoffel words defined in [14] generalize some properties of circular sturmian words. Here we prove a factorization property and the existence of the reduction tree, that uniquely identifies the structure of the word. Furthermore, in the paper we investigate the problem of the minimization of Moore automata by defining a variant of Hopcroft's minimization algorithm. The use of this variant makes simpler the computation of the running time and consequ…

On the Shuffle of Star-Free Languages

2012

Motivated by the general problem to characterize families of languages closed under shuffle, we investigate some conditions under which the shuffle of two star-free languages is star-free. Some of the special cases here approached give rise to new problems in combinatorics on words.

An elementary proof of Hilbertʼs theorem on ternary quartics

2012

Abstract In 1888, Hilbert proved that every nonnegative quartic form f = f ( x , y , z ) with real coefficients is a sum of three squares of quadratic forms. His proof was ahead of its time and used advanced methods from topology and algebraic geometry. Up to now, no elementary proof is known. Here we present a completely new approach. Although our proof is not easy, it uses only elementary techniques. As a by-product, it gives information on the number of representations f = p 1 2 + p 2 2 + p 3 2 of f up to orthogonal equivalence. We show that this number is 8 for generically chosen f, and that it is 4 when f is chosen generically with a real zero. Although these facts were known, there wa…

Some integral type fixed point theorems in Non-Archimedean Menger PM-Spaces with common property (E.A) and application of functional equations in dyn…

2013

In this paper, we prove some integral type common fixed point theorems for weakly compatible mappings in Non-Archimedean Menger PM-spaces employing common property (E.A). Some examples are furnished which demonstrate the validity of our results. We extend our main result to four finite families of self-mappings employing the notion of pairwise commuting. Moreover, we give an application which supports the usability of our main theorem.

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, …