Search results for "Crete"
showing 10 items of 2495 documents
Lattices of Jordan algebras
2010
AbstractCommutative Jordan algebras play a central part in orthogonal models. The generations of these algebras is studied and applied in deriving lattices of such algebras. These lattices constitute the natural framework for deriving new orthogonal models through factor aggregation and disaggregation.
Minimal Forbidden Factors of Circular Words
2017
Minimal forbidden factors are a useful tool for investigating properties of words and languages. Two factorial languages are distinct if and only if they have different (antifactorial) sets of minimal forbidden factors. There exist algorithms for computing the minimal forbidden factors of a word, as well as of a regular factorial language. Conversely, Crochemore et al.ÃÂ [IPL, 1998] gave an algorithm that, given the trie recognizing a finite antifactorial language M, computes a DFA of the language having M as set of minimal forbidden factors. In the same paper, they showed that the obtained DFA is minimal if the input trie recognizes the minimal forbidden factors of a single word. We gener…
Radial growth of solutions to the poisson equation
2001
We establish a radial growth estimate of the type of the iterated law of the logarithm for solutions to the Poisson equation in the unit ball.
Discrete KP Equation and Momentum Mapping of Toda System
2003
Abstract A new approach to discrete KP equation is considered, starting from the Gelfand-Zakhharevich theory for the research of Casimir function for Toda Poisson pencil. The link between the usual approach through the use of discrete Lax operators, is emphasized. We show that these two different formulations of the discrete KP equation are equivalent and they are different representations of the same equations. The relation between the two approaches to the KP equation is obtained by a change of frame in the space of upper truncated Laurent series and translated into the space of shift operators.
Leader election and local identifiers for three‐dimensional programmable matter
2020
International audience; In this paper, we present two deterministic leader election algorithms for programmable matter on the face-centered cubic grid. The face-centered cubic grid is a 3-dimensional 12-regular infinite grid that represents an optimal way to pack spheres (i.e., spherical particles or modules in the context of the programmable matter) in the 3-dimensional space. While the first leader election algorithm requires a strong hypothesis about the initial configuration of the particles and no hypothesis on the system configurations that the particles are forming, the second one requires fewer hypothesis about the initial configuration of the particles but does not work for all pos…
Assessment of workflow feature selection on forest LAI prediction with sentinel-2A MSI, landsat 7 ETM+ and Landsat 8 OLI
2020
The European Space Agency (ESA)’s Sentinel-2A (S2A) mission is providing time series that allow the characterisation of dynamic vegetation, especially when combined with the National Aeronautics and Space Administration (NASA)/United States Geological Survey (USGS) Landsat 7 (L7) and Landsat 8 (L8) missions. Hybrid retrieval workflows combining non-parametric Machine Learning Regression Algorithms (MLRAs) and vegetation Radiative Transfer Models (RTMs) were proposed as fast and accurate methods to infer biophysical parameters such as Leaf Area Index (LAI) from these data streams. However, the exact design of optimal retrieval workflows is rarely discussed. In this study, the impact of…
Vertical representation of C∞-words
2015
We present a new framework for dealing with C ∞ -words, based on their left and right frontiers. This allows us to give a compact representation of them, and to describe the set of C ∞ -words through an infinite directed acyclic graph G. This graph is defined by a map acting on the frontiers of C ∞ -words. We show that this map can be defined recursively and with no explicit reference to C ∞ -words. We then show that some important conjectures on C ∞ -words follow from analogous statements on the structure of the graph G.
On limits and colimits of variety-based topological systems
2011
The paper provides variety-based extensions of the concepts of (lattice-valued) interchange system and space, introduced by Denniston, Melton and Rodabaugh, and shows that variety-based interchange systems incorporate topological systems of Vickers, state property systems of Aerts, Chu spaces (over the category of sets in the sense of Pratt) of P.-H. Chu and contexts (of formal concept analysis) of Wille. The paper also provides an explicit description of (co)limits in the category of variety-based topological systems and applies the obtained results to extend the claim of Denniston et al. that the category of topological systems of Vickers is small initially topological over the category o…
The J-invariant, Tits algebras and Triality
2012
In the present paper we set up a connection between the indices of the Tits algebras of a simple linear algebraic group $G$ and the degree one parameters of its motivic $J$-invariant. Our main technical tool are the second Chern class map and Grothendieck's $\gamma$-filtration. As an application we recover some known results on the $J$-invariant of quadratic forms of small dimension; we describe all possible values of the $J$-invariant of an algebra with orthogonal involution up to degree 8 and give explicit examples; we establish several relations between the $J$-invariant of an algebra $A$ with orthogonal involution and the $J$-invariant of the corresponding quadratic form over the functi…
Steiner systems and configurations of points
2020
AbstractThe aim of this paper is to make a connection between design theory and algebraic geometry/commutative algebra. In particular, given any Steiner SystemS(t, n, v) we associate two ideals, in a suitable polynomial ring, defining a Steiner configuration of points and its Complement. We focus on the latter, studying its homological invariants, such as Hilbert Function and Betti numbers. We also study symbolic and regular powers associated to the ideal defining a Complement of a Steiner configuration of points, finding its Waldschmidt constant, regularity, bounds on its resurgence and asymptotic resurgence. We also compute the parameters of linear codes associated to any Steiner configur…