Related papers: Flow polytopes of signed graphs and the Kostant pa…
Let $K$ be a convex body in $\R^d$, let $j\in\{1, ..., d-1\}$, and let $\varrho$ be a positive and continuous probability density function with respect to the $(d-1)$-dimensional Hausdorff measure on the boundary $\partial K$ of $K$. Denote…
We construct a class of monotonic quantities along the normalized Ricci flow on closed n-dimensional manifolds.
The one-dimensional Navier-Stokes equations are used to derive analytical expressions for the relation between pressure and volumetric flow rate in capillaries of five different converging-diverging axisymmetric geometries for Newtonian…
Using a new graphical representation for partitions, the author obtains a family of partition identities associated with partitions into distinct parts of an arithmetic progression, or, more generally, with partitions into distinct parts of…
The random polytope $K_n$, defined as the convex hull of $n$ points chosen uniformly at random on the boundary of a smooth convex body, is considered. Proofs for lower and upper variance bounds, strong laws of large numbers and central…
In a previous paper: A. Paszkiewicz, T. Sobieszek, Additive Entropies of Partitions, we have given a description of additive partition entropies that is real functions $I$ on the set of finite partitions that are additive on stochastically…
We establish a Morris type recurrence formula for the root system $C_{n}$.\ Next we introduce cyclage graphs for the corresponding Kashiwara-Nakashima's tableaux and use them to define a charge statistic. Finally we conjecture that this…
The type C_n full root polytope is the convex hull in R^n of the origin and the points e_i-e_j, e_i+e_j, 2e_k for 1 <= i < j <= n, k \in [n]. Given a graph G, with edges labeled positive or negative, associate to each edge e of G a vector…
In particle-laden turbulent flows the turbulence in carrier fluid phase gets affected by the dispersed particle phase for volume fraction above $10^{-4}$ and hence reverse coupling or two-way coupling becomes relevant in that volume…
PQ-type adjacency polytopes $\nabla^{\rm PQ}_G$ are lattice polytopes arising from finite graphs $G$. There is a connection between $\nabla^{\rm PQ}_G$ and the engineering problem known as power-flow study, which models the balance of…
In this paper we give an introduction to the volume conjecture and its generalizations. Especially we discuss relations of the asymptotic behaviors of the colored Jones polynomials of a knot with different parameters to representations of…
We consider an extended version of Horn's problem: given two orbits $\mathcal{O}_\alpha$ and $\mathcal{O}_\beta$ of a linear representation of a compact Lie group, let $A\in \mathcal{O}_\alpha$, $B\in \mathcal{O}_\beta$ be independent and…
We construct invariants of relative K-theory classes of multiparameter dependent pseudodifferential operators, which recover and generalize Melrose's divisor flow and its higher odd-dimensional versions of Lesch and Pflaum. These higher…
The notion of the flow introduced by Kitaev is a manifestly topological formulation of the winding number on a real lattice. First, we show in this paper that the flow is quite useful for practical numerical computations for systems without…
Let $(P,\leq_P)$ and $(Q,\leq_Q)$ be finite partially ordered sets with $|P|=|Q|=d$, and $\mathcal{C}(P) \subset \mathbb{R}^d$ and $\mathcal{C}(Q) \subset \mathbb{R}^d$ their chain polytopes. The twinned chain polytope of $P$ and $Q$ is the…
We apply some recent developments of Baldoni-Beck-Cochet-Vergne on vector partition function, to Kostant's and Steinberg's formulae, for classical Lie algebras $A\_r$, $B\_r$, $C\_r$, $D\_r$. We therefore get efficient {\tt Maple} programs…
Kontsevich's graphs from deformation quantisation allow encoding multi-vectors whose coefficients are differential-polynomial in components of Poisson brackets on finite-dimensional affine manifolds. The calculus of Kontsevich graphs can be…
Let $G=(V,E)$ be a simple undirected graph with $n$ vertices then a set partition $\pi=\{V_1, ..., V_k\}$ of the vertex set of $G$ is a connected set partition if each subgraph $G[V_j]$ induced by the blocks $V_j$ of $\pi$ is connected for…
A cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes. The paper is concerned with the linkedness of the graphs of cubical polytopes. A graph with at least $2k$ vertices is $k$-linked if, for every…
Regular semisimple Hessenberg varieties are subvarieties of the flag variety $\mathrm{Flag}(\mathbb{C}^n)$ arising naturally in the intersection of geometry, representation theory, and combinatorics. Recent results of…