Related papers: A Valuation-Theoretic Approach to Translative-Equi…

This paper deals with transportation polytopes in the probability simplex (that is, sets of categorical bivariate probability distributions with prescribed marginals). Information projections between such polytopes are studied, and a…

An efficient evaluation method is described for polynomials in finite fields. Its complexity is shown to be lower than that of standard techniques when the degree of the polynomial is large enough. Applications to the syndrome computation…

We investigate computability in the lattice of equivalence relations on the natural numbers. We mostly investigate whether the subsets of appropriately defined subrecursive equivalence relations -for example the set of all polynomial-time…

This paper considers the local integrability condition for generalised translation-invariant systems and its relation to the Calder\'on integrability condition, the temperateness condition and the uniform counting estimate. It is shown that…

We use evaluation representations to give a complete classification of the finite-dimensional simple modules of twisted current algebras. This generalizes and unifies recent work on multiloop algebras, current algebras, equivariant map…

Downward translation of equality refers to cases where a collapse of some pair of complexity classes would induce a collapse of some other pair of complexity classes that (a priori) one expects are smaller. Recently, the first downward…

We introduce and study varions notions of completeness of translation-invariant ideals in groups.

This article is the third part of the series of articles where the theory of valuations on manifolds is constructed. In math.MG/0503399 the notion of a smooth valuation on a manifold was introduced. The goal of this article is to put a…

We present the theory of higher order invariants and higher order automorphic forms in the simplest case, that of a compact quotient. In this case many things simplify and we are thus able to prove a more precise structure theorem than in…

We describe a method to evaluate multivariate polynomials over a finite field and discuss its multiplicative complexity.

We show that arithmetic definability of henselian valuations is preserved by the tilting correspondence. Moreover, we show that if a perfectoid valuation is arithmetically definable, then no parameters are needed. We also investigate…

We show that the bicategory of (representable) orbifolds and good maps is equivalent to the bicategory of orbifold translation groupoids and generalized equivariant maps. We use this result to define an orbifold version of Bredon…

This paper concerns the explicit treatment of substitutions in the lambda calculus. One of its contributions is the simplification and rationalization of the suspension calculus that embodies such a treatment. The earlier version of this…

We define a certain class of simple varieties over a field $k$ by a constructive recipe and show how to control their (equivariant) truncating invariants. Consequently, we prove that on simple varieties: (i) if $k=\overline{k}$ and…

There is a well known construction of weakly continuous valuations on convex compact polytopes in R^n. In this paper we investigate when a special case of this construction gives a valuation which extends by continuity in the Hausdorff…

Motivated by the multivariate wavelet theory, and by the spectral theory of transfer operators, we construct an abstract affine structure and a multiresolution associated to a matrix-valued weight. We describe the one-to-one correspondence…

Twisted Lie algebroid cohomologies, i.e. with values in representations, are shown to be Lie algebroid homotopy-invariant. Several important classes of examples are discussed. As an application, a generalized version of the Poincar\'e lemma…

We construct an equivariant version of discrete Morse theory for simplicial complexes endowed with group actions. The key ingredient is a 2-categorical criterion for making acyclic partial matchings on the quotient space compatible with an…

Many combinatorial proofs rely on induction. When these proofs are formulated in traditional language, they can be bulky and unmanageable. Coalgebras provide a language which can reduce reduce many inductive proofs in graded poset theory to…

The paper is a contribution both to the theoretical foundations and to the actual construction of efficient automatizable proof procedures for non-classical logics. We focus here on the case of finite-valued logics, and exhibit: (i) a…