相关论文: Affine $\Lambda$-Buildings II
An alternative approach for minimum and mode-dependent dwell-time characterization for switched systems is derived. The proposed technique is related to Lyapunov looped-functionals, a new type of functionals leading to stability conditions…
We generalize an algorithm of Leclerc describing explicitly the bijection of Lalonde-Ram from finite to affine Lie algebras. In type $A_n^{(1)}$, we compute all affine standard Lyndon words for any order of the simple roots, and establish…
We give an elementary construction of a certain class of model structures. In particular, we rederive the Kan model structure on simplicial sets without the use of topological spaces, minimal complexes, or any concrete model of fibrant…
We describe simple criteria under which a given functor is naturally equivalent to an enriched one. We do this for several bases of enrichment, namely (pointed) simplicial sets, (pointed) topological spaces and orthogonal spectra. We also…
In this article we construct affine systems that provide a simultaneous atomic decomposition for a wide class of functional spaces including the Lebesgue spaces $L^p(\Rdst)$, $1<p<+\infty$. The novelty and difficulty of this construction is…
The Algebraic lambda-calculus and the Linear-Algebraic lambda-calculus extend the lambda-calculus with the possibility of making arbitrary linear combinations of terms. In this paper we provide a fine-grained, System F-like type system for…
In \cite{FGLNP}, Fox, Gromov, Lafforgue, Naor and Pach, in a respond to a question of Gromov \cite{G}, constructed bounded degree geometric expanders, namely, simplical complexes having the affine overlapping property. Their explicit…
We analyse the axioms of Euclidean geometry according to standard object-oriented software development methodology. We find a perfect match: the main undefined concepts of the axioms translate to object classes. The result is a suite of C++…
Finite dimensional simple modules of quantum affine algebras of type A correspond to semistandard Young tableaux of rectangular shapes. In this paper, we classify all prime modules corresponding to 2-column semistandard Young tableaux, up…
By Lindstr\"{o}m's theorems, the expressive power of first order logic (and similarly continuous logic) is not strengthened without losing some interesting property. Weakening it, is however less harmless and has been payed attention by…
A structural analysis of construction schemes is developed. That analysis is used to give simple and new constructions of combinatorial objects which have been of interest to set theorists and topologists. We then continue the study of…
In this paper, algebroid bundle associated to affine metrics provide an structure for unification of gravity and electromagnetism and, geometrization of matter.
In the present work, a natural sequel to \cite{MaPi1}, we further discuss the existence of adjunctions between categories of institutions and of $\pi$-institutions. This is done at both a foundational and an applied level. Firstly, we…
Extending the lambda-calculus with a construct for sharing, such as let expressions, enables a special representation of terms: iterated applications are decomposed by introducing sharing points in between any two of them, reducing to the…
Typing of lambda-terms in Elementary and Light Affine Logic (EAL, LAL, resp.) has been studied for two different reasons: on the one hand the evaluation of typed terms using LAL (EAL, resp.) proof-nets admits a guaranteed polynomial…
We consider the non-deterministic extension of the call-by-value lambda calculus, which corresponds to the additive fragment of the linear-algebraic lambda-calculus. We define a fine-grained type system, capturing the right linearity…
The dynamical behavior of switched affine systems is known to be more intricate than that of the well-studied switched linear systems, essentially due to the existence of distinct equilibrium points for each subsystem. First, under…
The paper presents a new set of axioms of digital topology, which are easily understandable for application developers. They define a class of locally finite (LF) topological spaces. An important property of LF spaces satisfying the axioms…
Axioms are presented which encapsulate the properties satisfied by categories of games which form the basis of results on full abstraction for PCF and other programming languages, and on full completeness for various logics and type…
We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…