相关论文: Infinitary Intersection Types as Sequences: a New …

We introduce an interpolation framework for H-infinity model reduction founded on ideas originating in optimal-H2 interpolatory model reduction, realization theory, and complex Chebyshev approximation. By employing a Loewner "data-driven"…

Decidability of definitional equality and conversion of terms into canonical form play a central role in the meta-theory of a type-theoretic logical framework. Most studies of definitional equality are based on a confluent,…

We obtain new uniform bounds for the symmetric tensor rank of multiplication in finite extensions of any finite field Fp or Fp2 where p denotes a prime number greater or equal than 5. In this aim, we use the symmetric Chudnovsky-type…

We describe a new method of proving a priori bounds for positive supersolutions and solutions of superlinear elliptic PDE, based on global weak Harnack inequalities and a quantitative Hopf lemma. Novel results based on the method include:…

This paper generalizes a theorem of Hida on the structure of ordinary representations on unitary groups to $P$-ordinary representations, where $P$ is a general parabolic subgroup of some general linear group. When $P$ is minimal, we recover…

We define a new class of infinitary logics $\mathscr L^1_{\kappa,\alpha}$ generalizing Shelah's logic $\mathbb L^1_\kappa$ defined in \cite{MR2869022}. If $\kappa=\beth_\kappa$ and $\alpha <\kappa$ is infinite then our logic coincides with…

We study the Hardy type inequalities in the framework of equalities. We present equalities which immediately imply Hardy type inequalities by dropping the remainder term. Simultaneously we give a characterization of the class of functions…

The lambda calculus with constructors is an extension of the lambda calculus with variadic constructors. It decomposes the pattern-matching a la ML into a case analysis on constants and a commutation rule between case and application…

Much combinatorial optimisation problems constitute a non-polynomial (NP) hard optimisation problem, i.e., they can not be solved in polynomial time. One such problem is finding the shortest route between two nodes on a graph.…

In a previous article, we introduced notions of finiteness obstruction, Euler characteristic, and L^2-Euler characteristic for wide classes of categories. In this sequel, we prove the compatibility of those notions with homotopy colimits of…

We consider the numerical solution of Hamilton-Jacobi-Bellman equations arising in stochastic control theory. We introduce a class of monotone approximation schemes relying on monotone interpolation. These schemes converge under very weak…

In this paper, we study $\Delta$- convergence of iterations for a sequence of strongly quasi-nonexpansive mappings as well as the strong convergence of the Halpern type regularization of them in Hadamard spaces. Then, we give some their…

The aim of this thesis is to determine classes of NP relations for which random generation and approximate counting problems admit an efficient solution. Since efficient rank implies efficient random generation, we first investigate some…

System I is a simply-typed lambda calculus with pairs, extended with an equational theory obtained from considering the type isomorphisms as equalities. In this work we propose an extension of System I to polymorphic types, adding the…

In this paper, we introduce three new iterative methods for finding a common point of the set of fixed points of a symmetric generalized hybrid mapping and the set of solutions of an equilibrium problem in a real Hilbert space. Each method…

This paper shows that the recent approach to quantitative typing systems for programming languages can be extended to pattern matching features. Indeed, we define two resource aware type systems, named U and E, for a lambda-calculus…

We establish a new algebraic characterization of sectional curvature bounds $\sec\geq k$ and $\sec\leq k$ using only curvature terms in the Weitzenb\"ock formulae for symmetric $p$-tensors. By introducing a symmetric analogue of the…

We study Krasnoselskii-Mann style iterative algorithms for approximating fixpoints of asymptotically weakly contractive mappings, with a focus on providing generalised convergence proofs along with explicit rates of convergence. More…

We give a characterization, with respect to a large class of models of untyped lambda-calculus, of those models that are fully abstract for head-normalization, i.e., whose equational theory is H* (observations for head normalization). An…

Many definitions of weak and strict $\infty$-categories have been proposed. In this paper we present a definition for $\infty$-categories with strict associators, but which is otherwise fully weak. Our approach is based on the existing type…