Let $N$ be a closed manifold and $U \subset T^\*(N)$ bounded domain in the cotangent bundle of $N$, containing zero-section. A conjecture due to Viterbo asserts that spectral metric for Lagrangian submanifolds $U$ are exact-isotopic zero-section is bounded. In this paper we establish an upper bound on distance between two such Lagrangians $L\_0, L\_1$, which depends linearly boundary depth Floe...

Let A be a finite, totally ordered alphabet, and let P be the lexicographic ordering on A*. Let X be a subset of A*. The language of minimal words of X is the subset of X composed of the lexicographically minimal word of X for each length: Min(X)=[x # X | \w # X, |w|=|x| O xPw]. The aim of this paper is to prove that if L is a context-free language, then the language Min(L) context-free. ] 1997

Abstract Introduction Example of a Free LD, I Example of a Free LD, II Ordering A A is Linearly Ordered by <L A subset of A that is not well-ordered An Extension of AIntroduction Example of a Free LD, I Example of a Free LD, II Ordering A A is Linearly Ordered by <L A subset of A that is not well-ordered An Extension of A

Given a Latin square L and a subset F of its autotopism group U(L), we study in this paper some properties and results which partial Latin squares contained in L inherit from U(L), by using F. In particular, we define the concept of F-critical set of L and we ask ourselves about the smallest one contained in L.

Granas and Dugundji obtained the following generalization of the Knaster-Kuratowski-Mazurkiewicz theorem. Let X be a subset of a topological vector space E and let G be a setvalued map from X into E such that for each finite subset {xi.xn} of X, co{x,, ... , xn} C (J/Li Gx¡ and for each x e X , Gx is finitely closed, i.e., for any finite-dimensional subspace L of E , Gx D L is closed in the Euc...

Matching Pursuit (MP) uses a greedy search to construct a subset of vectors, from a larger set, which will best represent a signal of interest. Here, we extend this search for the best subset by keeping the K vectors which maximize the selection criterion at each iteration. This is termed the MP:K algorithm and represents a suboptimal search through the tree of all possible subsets where each n...

Intrusion detection systems are designed to provide security in computer networks, so that if the attacker crosses other security devices, they can detect and prevent the attack process. One of the most essential challenges in designing these systems is the so called curse of dimensionality. Therefore, in order to obtain satisfactory performance in these systems we have to take advantage of app...

Let Fn be the set of cuspidal automorphic representations π GLn over a number field with unitary central character. We prove two unconditional large sieve inequalities for Hecke eigenvalues π∈Fn, one on integers and primes. The second leads to first zero density estimate family L-functions L(s,π) associated which we make log-free. As an application estimate, hybrid subconvexity bound L(12,π) su...

We work in set-theory without choice ZF. Given a closed subset F of [0, 1] which is a bounded subset of l(I) (resp. such that F ⊆ l(I)), we show that the countable axiom of choice for finite subsets of I, (resp. the countable axiom of choiceACN) implies that F is compact. This enhances previous results where ACN (resp. the axiom of Dependent Choices DC) was required. Moreover, if I is linearly ...