中文
相关论文

相关论文: Enumeration of bilaterally symmetric 3-noncrossing…

200 篇论文

We compute the representation theory of two families of noncrossing partition quantum groups connected to amalgamated free products and free wreath products. This illustrates the efficiency of the methods developed in our previous joint…

表示论 · 数学 2018-06-12 Amaury Freslon

We present a bijection between non-crossing partitions of the set $[2n+1]$ into $n+1$ blocks such that no block contains two consecutive integers, and the set of sequences $\{s_{i}\}_{1}^{n}$ such that $1 \leq s_{i} \leq i$, and if…

组合数学 · 数学 2007-05-23 Rekha Natarajan

In this paper, we introduce a natural geometric extension of the partition function. More precisely, we investigate the problem of counting partitions of a rectangle into rectangular blocks with integer sides. Here, two partitions of a…

组合数学 · 数学 2025-10-02 Krystian Gajdzica , Robin Visser , Maciej Zakarczemny

We give a Lie-algebraic classification of third order quasilinear equations which admit non-trivial Lie point symmetries.

可精确求解与可积系统 · 物理学 2010-10-07 P. Basarab-Horwath , F. Gungor , V. Lahno

We prove equidistribution of two pairs of statistics on boxed plane partitions: (volume, trace) and (corner-hook volume, number of corners). The proof relies on different 3d visualizations of the corresponding non-intersecting path systems.…

组合数学 · 数学 2026-05-15 Alimzhan Amanov , Damir Yeliussizov

Incorporating symmetries into the numerical solution of differential equations has been a mainstay of research over the last 40 years, however, one aspect is less known and under-utilised: discretisations of partial differential equations…

数值分析 · 数学 2025-10-16 Sheehan Olver

For a matrix *-algebra B, consider the matrix *-algebra A consisting of the symmetric tensors in the n-fold tensor product of B. Examples of such algebras in coding theory include the Bose-Mesner algebra and Terwilliger algebra of the…

最优化与控制 · 数学 2009-10-26 Dion Gijswijt

In this note we present new examples of determinantal point processes with infinitely many particles. The particles live on the half-lattice {1,2,...} or on the open half-line (0,+\infty). The main result is the computation of the…

概率论 · 数学 2010-11-16 Leonid Petrov

Tverberg's theorem is one of the cornerstones of discrete geometry. It states that, given a set $X$ of at least $(d+1)(r-1)+1$ points in $\mathbb R^d$, one can find a partition $X=X_1\cup \ldots \cup X_r$ of $X$, such that the convex hulls…

计算几何 · 计算机科学 2021-04-13 Radoslav Fulek , Bernd Gärtner , Andrey Kupavskii , Pavel Valtr , Uli Wagner

Krawtchouk matrices have as entries values of the Krawtchouk polynomials for nonnegative integer arguments. We show how they arise as condensed Sylvester-Hadamard matrices via a binary shuffling function. The underlying symmetric tensor…

量子物理 · 物理学 2007-05-23 Philip Feinsilver , Jerzy Kocik

Every link in the 3-sphere has a projection to the plane where the only singularities are pairwise transverse triple points. The associated diagram, with height information at each triple point, is a triple-crossing diagram of the link. We…

几何拓扑 · 数学 2017-06-29 Colin Adams , Jim Hoste , Martin Palmer

We provide a short combinatorial proof of Cayley's formula by means of a bijective map to an outcome space of an urn-drawing problem. Furthermore we introduce an algebraic structure on the set of labeled trees, which provides a more…

组合数学 · 数学 2011-02-01 Victor N. Ermolaev , Giulio Iacobelli

We consider discrete orthogonal polynomial ensembles which are discrete analogues of the orthogonal polynomial ensembles in random matrix theory. These ensembles occur in certain problems in combinatorial probability and can be thought of…

组合数学 · 数学 2007-05-23 Kurt Johansson

Given an even number of points in a plane, we are interested in matching all the points by straight line segments so that the segments do not cross. Bottleneck matching is a matching that minimizes the length of the longest segment. For…

计算几何 · 计算机科学 2016-02-17 Marko Savić , Miloš Stojaković

For any positive integers $a$ and $b$, we enumerate all colored partitions made by noncrossing diagonals of a convex polygon into polygons whose number of sides is congruent to $b$ modulo $a$. For the number of such partitions made by a…

组合数学 · 数学 2017-01-23 Daniel Birmajer , Juan B. Gil , Michael D. Weiner

Let J and J* be subsets of Z+ such that 0,1\in J and 0\in J*. For infinitely many n, let k=(k_1,..., k_n) be a vector of nonnegative integers whose sum M is even. We find an asymptotic expression for the number of multigraphs on the vertex…

组合数学 · 数学 2013-09-24 Catherine Greenhill , Brendan D McKay

We give a criterion for Bruhat order on noncrossing partitions corresponding to the Coxeter element $c=s_1 s_2\cdots s_n$. Using it we prove that the Bruhat order endows noncrossing partitions with a lattice structure. We then explain what…

组合数学 · 数学 2015-03-04 Thomas Gobet

Having developed a description of indefinite extrinsic symmetric spaces by corresponding infinitesimal objects in the preceding paper we now study the classification problem for these algebraic objects. In most cases the transvection group…

微分几何 · 数学 2010-04-13 Ines Kath

Bayesian nonparametric space partition (BNSP) models provide a variety of strategies for partitioning a $D$-dimensional space into a set of blocks. In this way, the data points lie in the same block would share certain kinds of homogeneity.…

机器学习 · 统计学 2021-03-02 Xuhui Fan , Bin Li , Ling Luo , Scott A. Sisson

We give combinatorial proofs of two identities from the representation theory of the partition algebra $C A_k(n), n \ge 2k$. The first is $n^k = \sum_\lambda f^\lambda m_k^\lambda$, where the sum is over partitions $\lambda$ of $n$,…

组合数学 · 数学 2007-05-23 Tom Halverson , Tim Lewandowski