Related papers: Reductions of Young tableau bijections
We introduce a hierarchy of degree structures between the Medvedev and Muchnik lattices which allow varying amounts of non-uniformity. We use these structures to introduce the notion of the uniformity of a Muchnik reduction, which expresses…
We show that the Young tableaux theory and constructions of the irreducible representations of the Weyl groups of type A, B and D, Iwahori-Hecke algebras of types A, B, and D, the complex reflection groups G(r,p,n) and the corresponding…
Digraphs provide an alternative syntax for propositional logic, with digraph kernels corresponding to classical models. Semikernels generalize kernels and we identify a subset of well-behaved semikernels that provides nontrivial models for…
Let J be the jacobian of a reduced projective curve C with nodes only. 1) We give a simple and natural definition for its many compactifications and show the connection with various other definitions appearing in the literature. 2) Among…
In a previous paper, we provided some update in the treatment of the finiteness theorem for rational maps of finite degree from a fixed variety to varieties of general type. In the present paper we present another improvement, introducing…
Conjunctive table algebras are introduced and axiomatically characterized. A conjunctive table algebra is a variant of SPJR algebra (a weaker form of relational algebra), which corresponds to conjunctive queries with equality. The table…
A linear arrangement is a labeling or a numbering or a linear ordering of the vertices of a graph. In this paper we solve the minimum linear arrangement problem for bijective connection graphs (for short BC graphs) which include hypercubes,…
A recurrence relation is said to have the Laurent property if all of its iterates are Laurent polynomials in the initial values with integer coefficients. We consider a family of nonlinear recurrences with the Laurent property, which were…
In this paper, we present methods to simplify reducible linear differential systems before solving. Classical integrals appear naturally as solutions of such systems. We will illustrate the methods developed in a previous paper on several…
A computationally challenging classical elimination theory problem is to compute polynomials which vanish on the set of tensors of a given rank. By moving away from computing polynomials via elimination theory to computing pseudowitness…
We define a bijection between triangulations of a convex polygon and $312$-avoiding permutations through the process of "ear-clipping". This bijection is then used to obtain a bijection between polygon dissections and a certain class of…
In this short survey we concern ourselves with minimal codes, a classical object in coding theory. We will explain the relation between minimal codes and various other mathematical domains, in particular with finite projective geometry.…
We discuss counting problems linked to finite versions of Cantor's diagonal of infinite tableaux. We extend previous results of [2] by refining an equivalence relation that reduces significantly the exhaustive generation. New enumerative…
We describe a type system for the linear-algebraic lambda-calculus. The type system accounts for the part of the language emulating linear operators and vectors, i.e. it is able to statically describe the linear combinations of terms…
We survey current developments in the approximation theory of sequence modelling in machine learning. Particular emphasis is placed on classifying existing results for various model architectures through the lens of classical approximation…
We present bijections for planar maps with boundaries. In particular, we obtain bijections for triangulations and quadrangulations of the sphere with boundaries of prescribed lengths. For triangulations we recover the beautiful factorized…
We extend Schaeffer's bijection between rooted quadrangulations and well-labeled trees to the general case of Eulerian planar maps with prescribed face valences, to obtain a bijection with a new class of labeled trees, which we call…
Using linear projections one gets new inequalities for the successive minima of the lattice of sections of an hermitian line bundle on an arithmetic surface.
Unexpected product formulas for the number of standard Young tableaux of certain truncated shapes are found and proved. These include shifted staircase shapes minus a square in the NE corner, rectangular shapes minus a square in the NE…
A number of recent papers treated the representation theory of partially ordered sets in unitary spaces with the so called orthoscalar relation. Such theory generalizes the classical theory which studies the representations of partially…