相关论文: Standard paths in another composition poset
We present a simple bijection between permutation matrices and descending plane partitions without special parts. This bijection is already mentioned in work of P. Lalonde (without giving the details); it involves the inversion words of…
The proper parts of face lattices of convex polytopes are shown to satisfy a strong form of the Cohen--Macaulay property, namely that removing from their Hasse diagram all edges in any closed interval results in a Cohen--Macaulay poset of…
We give bijective results between several variants of lattice paths of length $2n$ (or $2n-2$) and integer compositions of n, all enumerated by the seemingly innocuous formula $4^{n-1}$. These associations lead us to make new connections…
Starting from the data of an arbor, which is a rooted tree with vertices decorated by disjoint sets, we introduce a lattice polytope and a partial order on its lattice points. We give recursive algorithms for various classical invariants of…
Let $P$ be a set of $2n$ points in convex position, such that $n$ points are colored red and $n$ points are colored blue. A non-crossing alternating path on $P$ of length $\ell$ is a sequence $p_1, \dots, p_\ell$ of $\ell$ points from $P$…
In this paper the theorems that determine composition laws for both cardinal ordering permutations and their inverses are proven. So, the relative positions of points in a hs-periodic orbit become completely known as well as in which order…
We survey two decades of work on the (sequential) topological complexity of configuration spaces of graphs (ordered and unordered), aiming to give an account that is unifying, elementary, and self-contained. We discuss the traditional…
Let us denote $\lambda$ the Lebesgue measure on $[0,1]$, put$$ C(\lambda)=\{f\in C([0,1]);\ \forall~A\subset [0,1], A~\text{Borel}:\ \lambda(A)=\lambda(f^{-1}(A))\}.$$ We endow the set $C(\lambda)$ by the uniform metric $\rho$ and…
In this article we introduce the insertion method for reconstructing the path from its signature, i.e. inverting the signature of a path. For this purpose, we prove that a converging upper bound exists for the difference between the…
In this paper we introduce a word embedding composition method based on the intuitive idea that a fair embedding representation for a given set of words should satisfy that the new vector will be at the same distance of the vector…
A new method (by Kersten, Krasil'shchik and Verbovetsky), based on the theory of differential coverings, allows to relate a system of PDEs with a differential operator in such a way that the operator maps symmetries/conserved quantities…
A boolean term order is a total order on subsets of [n]={1,...,n} such that \emptyset < alpha for all nonempty alpha contained in [n], and alpha < beta implies alpha \cup gamma < beta \cup gamma for all gamma which do not intersect alpha or…
The two main approaches to the study of irreducible representations of orders (via traces and Poisson orders) have so far been applied in a completely independent fashion. We define and study a natural compatibility relation between the two…
A paired $k$-to-$k$ disjoint path cover of a graph $G$ is a collection of pairwise disjoint path subgraphs $P_1,P_2,\dotsc,P_k$ such that each $P_i$ has prescribed vertices $s_i$ and $t_i$ as endpoints and the union of $P_1,P_2,\dotsc,P_k$…
We introduce a notion of noncommutative Poisson-Nijenhuis structure on the path algebra of a quiver. In particular, we focus on the case when the Poisson bracket arises from a noncommutative symplectic form. The formalism is then applied to…
A \emph{composition} is a sequence of positive integers, called \emph{parts}, having a fixed sum. By an \emph{$m$-congruence succession}, we will mean a pair of adjacent parts $x$ and $y$ within a composition such that $x\equiv y(\text{mod}…
We describe a general procedure which allows to construct, starting from a given Hamiltonian, the whole family of new ones sharing the same set of unparameterized trajectories in phase space. The symmetry structure of this family can be…
We propose new linear combinations of compositions of a basic second-order scheme with appropriately chosen coefficients to construct higher order numerical integrators for differential equations. They can be considered as a generalization…
We show combinatorially that the higher-order matching polynomials of several families of graphs are d-orthogonal polynomials. The matching polynomial of a graph is a generating function for coverings of a graph by disjoint edges; the…
Given all (finite) moments of two measures $\mu$ and $\lambda$ on $\R^n$, we provide a numerical scheme to obtain the Lebesgue decomposition $\mu=\nu+\psi$ with $\nu\ll\lambda$ and $\psi\perp\lambda$. When$\nu$ has a density in…