Search results for "Crete"
showing 10 items of 2495 documents
An existence result for a Neumann problem
2015
The main result of this paper deals with the existence of at least one positive solution for a second order Neumann boundary value problem. Such a result is obtained by using an abstract coincidence point theorem that allows to get our conclusion under non standard conditions on the nonlinearity.
Zeros of {-1,0,1}-power series and connectedness loci for self-affine sets
2006
We consider the set W of double zeros in (0,1) for power series with coefficients in {-1,0,1}. We prove that W is disconnected, and estimate the minimum of W with high accuracy. We also show that [2^(-1/2)-e,1) is contained in W for some small, but explicit e>0 (this was only known for e=0). These results have applications in the study of infinite Bernoulli convolutions and connectedness properties of self-affine fractals.
The Crane Beach Conjecture
2002
A language L over an alphabet A is said to have a neutral letter if there is a letter e/spl isin/A such that inserting or deleting e's from any word in A* does not change its membership (or non-membership) in L. The presence of a neutral letter affects the definability of a language in first-order logic. It was conjectured that it renders all numerical predicates apart from the order predicate useless, i.e., that if a language L with a neutral letter is not definable in first-order logic with linear order then it is not definable in first-order. Logic with any set /spl Nscr/ of numerical predicates. We investigate this conjecture in detail, showing that it fails already for /spl Nscr/={+, *…
Monadic second-order logic over pictures and recognizability by tiling systems
1994
We show that a set of pictures (rectangular arrays of symbols) is recognized by a finite tiling system if and only if it is definable in existential monadic second-order logic. As a consequence, finite tiling systems constitute a notion of recognizability over two-dimensional inputs which at the same time generalizes finite-state recognizability over strings and matches a natural logic. The proof is based on the Ehrenfeucht-FraIsse technique for first-order logic and an implementation of “threshold counting” within tiling systems.
Monadic Second-Order Logic over Rectangular Pictures and Recognizability by Tiling Systems
1996
Abstract It is shown that a set of pictures (rectangular arrays of symbols) is recognized by a finite tiling system iff it is definable in existential monadic second-order logic. As a consequence, finite tiling systems constitute a notion of recognizability over two-dimensional inputs which at the same time generalizes finite-state recognizability over strings and also matches a natural logic. The proof is based on the Ehrenfeucht–Fraisse technique for first-order logic and an implementation of “threshold counting” within tiling systems.
Recent results on syntactic groups of prefix codes
2012
International audience; We give a simplified presentation of groups in transformation monoids. We use this presentation to describe two recent results on syntactic groups of prefix codes. The first one uses Sturmian words to build finite bifix codes with a given permutation group as syntactic group. The second one describes a class of prefix codes such that all their syntactic groups are cyclic.
Some Decision Results on Nonrepetitive Words
1985
The paper addresses some generalizations of the Thue Problem such as: given a word u, does there exist an infinite nonrepetitive overlap free (or square free) word having u as a prefix? A solution to this as well as to related problems is given for the case of overlap free words on a binary alphabet.
Performance of a historical cantilever reinforced concrete bridge with half-joint degradation
2022
The lack of maintenance of roadway concrete bridges built from the Second World War until the 70 s of the 20th century has led in recent years to an ever-increasing request for safety assessments. When bridge performance in terms of Serviceability Limit State (SLS) and Ultimate Limit State (ULS) has to be evaluated, in-situ visual inspections and load tests for safety and maintenance assessment have to be coupled with structural analysis. In order to identify a sound bridge structural model and to assess the actual conservation state, more refined models than those usually considered for section and reinforcement design should be used to reproduce the results of load tests and perform globa…
On the arithmetically Cohen-Macaulay property for sets of points in multiprojective spaces
2017
We study the arithmetically Cohen-Macaulay (ACM) property for finite sets of points in multiprojective spaces, especially ( P 1 ) n (\mathbb P^1)^n . A combinatorial characterization, the ( ⋆ ) (\star ) -property, is known in P 1 × P 1 \mathbb P^1 \times \mathbb P^1 . We propose a combinatorial property, ( ⋆ s ) (\star _s) with 2 ≤ s ≤ n 2\leq s\leq n , that directly generalizes the ( ⋆ ) (\star ) -property to ( P 1 ) n (\mathbb P^1)^n for larger n n . We show that X X is ACM if and only if it satisfies the ( ⋆ n ) (\star _n) -property. The main tool for several of our results is an extension to the multiprojective setting of certain liaison methods in projective space.
Quantum Algorithm for Distribution-Free Junta Testing
2019
Inspired by a recent classical distribution-free junta tester by Chen, Liu, Serverdio, Sheng, and Xie (STOC’18), we construct a quantum tester for the same problem with complexity \(O(k/\varepsilon )\), which constitutes a quadratic improvement.