Related papers: A Continuous Analogue for Young Diagrams

We derive combinatorial identities, involving the Bernoulli and Euler numbers, for the numbers of standard Young tableaux of certain skew shapes. This generalizes the classical formulas of D. Andre on the number of up-down permutations. The…

Given a Bratteli diagram D we consider the compact topological space formed by all infinite paths on D. Two such path are said to be tail-equivalent when they "have the same tail", i.e. when they eventually coincide. This equivalence…

We develop a calculus for diagrams of knotted objects. We define Arrow presentations, which encode the crossing informations of a diagram into arrows in a way somewhat similar to Gauss diagrams, and more generally w-tree presentations,…

We establish several new relations between the discrete transition operator, the continuous Laplacian and the averaging operator associated with combinatorial and metric graphs. It is shown that these operators can be expressed through each…

Let $K$ be a link of Conway's normal form $C(m)$, $m \geq 0$, or $C(m,n)$ with $mn\textgreater{}0$, and let $D$ be a trigonal diagram of $K.$ We show that it is possible to transform $D$ into an alternating trigonal diagram, so that all…

Let $G$ be a graph such that, whenever two vertices $x$ and $y$ of $G$ are joined by three internally disjoint paths, $x$ and $y$ are adjacent. Jamison and Mulder determined that the set of such graphs coincides with the set of graphs that…

In 2006 Bonato and Tardif posed the Tree Alternative Conjecture (TAC): the equivalence class of a tree under the embeddability relation is, up to isomorphism, either trivial or infinite. In 2022 LaFlamme, et al. provided a rigorous…

We illustrate the interplay between certain discrete and continuous problems, by presenting a method for the study of the asymptotics of a divergent sequence, through consideration of the asymptotics of its continuous analogue

Diagram chasing is not an easy task. The coherence holds in a generalized sense if we have a mechanical method to judge whether given two morphisms are equal to each other. A simple way to this end is to reform a concerned category into a…

We report on a recently initiated project which aims at building a multi-layered parallel treebank of English and German. Particular attention is devoted to a dedicated predicate-argument layer which is used for aligning translationally…

The Yoccoz puzzle is a fundamental tool in Holomorphic Dynamics. The original combinatorial argument by Yoccoz, based on the Branner-Hubbard tableau, counts the preimages of a non-degenerate annulus in the puzzle. However, in some important…

While standard persistent homology has been successful in extracting information from metric datasets, its applicability to more general data, e.g. directed networks, is hindered by its natural insensitivity to asymmetry. We study a…

Graph theory is a branch of mathematics in which pair-wise relations between objects are studied. My PhD thesis, supervised by David R. Wood, introduces and investigates a new family of graphs, called link graphs, that generalises the…

We prove that for a topological space $X$, an equiconnected space $Z$ and a Baire-one mapping $g:X\to Z$ there exists a separately continuous mapping $f:X^2\to Z$ with the diagonal $g$, i.e. $g(x)=f(x,x)$ for every $x\in X$. Under a mild…

Diagram semigroups are interesting algebraic and combinatorial objects, several types of them originating from questions in computer science and in physics. Here we describe diagram semigroups in a general framework and extend our…

Mixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case in which such graphs are Cayley graphs of Abelian groups. These groups can be constructed by…

For a large class of tilings, including the Penrose tiling in two dimension as well as the icosahedral ones in 3 dimension, the continuous hull of such a tiling inherits a minimal lamination structure with flat leaves and a transversal…

Given a pair of number fields with isomorphic rings of adeles, we construct bijections between objects associated to the pair. For instance we construct an isomorphism of Brauer groups that commutes with restriction. We additionally…

Given two vectors $u$ and $v$, their outer sum is given by the matrix $A$ with entries $A_{ij} = u_{i} + v_{j}$. If the entries of $u$ and $v$ are increasing and sufficiently generic, the total ordering of the entries of the matrix is a…

We define a K-theoretic analogue of Fomin's dual graded graphs, which we call dual filtered graphs. The key formula in the definition is DU-UD= D + I. Our major examples are K-theoretic analogues of Young's lattice, of shifted Young's…