中文
相关论文

相关论文: The descent statistic on involutions is not log-co…

200 篇论文

We consider sequences of degrees of ordinary irreducible $S_n$-characters. We assume that the corresponding Young diagrams have rows and columns bounded by some linear function of $n$ with leading coefficient less than one. We show that any…

组合数学 · 数学 2014-06-09 Antonio Giambruno , Sergey Mishchenko

Nonparametric statistics for distribution functions F or densities f=F' under qualitative shape constraints provides an interesting alternative to classical parametric or entirely nonparametric approaches. We contribute to this area by…

统计方法学 · 统计学 2016-10-31 Lutz Duembgen , Petro Kolesnyk , Ralf A. Wilke

G3-style sequent calculi for the logics in the cube of non-normal modal logics and for their deontic extensions are studied. For each calculus we prove that weakening and contraction are height-preserving admissible, and we give a syntactic…

逻辑 · 数学 2020-02-20 Eugenio Orlandelli

We study the enumerative and analytic properties of some sequences constructed using tensor invariant theory. The octant sequences are constructed from the exceptional Lie group $G_2$ and the quadrant sequences from the special linear group…

组合数学 · 数学 2022-04-21 Alin Bostan , Jordan Tirrell , Bruce W. Westbury , Yi Zhang

In this paper, we proposed an interesting problem that might be classified into enumerative combinatorics. Featuring a distinctive two-fold dependence upon the sequences' terms, our problem can be really difficult, which calls for novel…

离散数学 · 计算机科学 2010-07-29 Zan Pan

We define a collection of functions $s_i$ on the set of plane trees (or standard Young tableaux). The functions are adapted from transpositions in the representation theory of the symmetric group and almost form a group action. They were…

组合数学 · 数学 2017-10-24 Laura Seegerer , Jennifer Tripp , Julianna Tymoczko , Judy Wang

Let $k \ge 3$ be a fixed integer. We exactly determine the asymptotic distribution of $\ln Z_k(G(n,m))$, where $Z_k(G(n,m))$ is the number of $k$-colourings of the random graph $G(n,m)$. A crucial observation to this aim is that the…

组合数学 · 数学 2016-09-15 Felicia Rassmann

In this paper, we consider the new family of recurrence sequences of $(q,k)$-generalized Fibonacci numbers. These sequences naturally extend the well-known sequences of $k$-generalized Fibonacci numbers and generalized $k$-order Pell…

数论 · 数学 2022-11-17 Gérsica Freitas , Alessandra Kreutz , Jean Lelis , Elaine Silva

A fundamental identity in the representation theory of the partition algebra is $n^k = \sum_{\lambda} f^\lambda m_k^\lambda$ for $n \geq 2k$, where $\lambda$ ranges over integer partitions of $n$, $f^\lambda$ is the number of standard Young…

组合数学 · 数学 2024-05-14 Zhanar Berikkyzy , Pamela E. Harris , Anna Pun , Catherine Yan , Chenchen Zhao

Normal approximations for descents and inversions of permutations of the set $\{1,2,...,n\}$ are well known. A number of sequences that occur in practice, such as the human genome and other genomes, contain many repeated elements. Motivated…

概率论 · 数学 2014-08-28 Mark Conger , D. Viswanath

This is the second in a series of articles devoted to showing that a typical covering map of large degree to a fixed, regular graph has its new adjacency eigenvalues within the bound conjectured by Alon for random regular graphs. The first…

离散数学 · 计算机科学 2019-11-14 Joel Friedman , David Kohler

In previous work Regev used part of the representation theory of Lie superalgebras to compute the values of a character of the symmetric group whose decomposition into irreducible constituents is described by semistandard…

表示论 · 数学 2017-09-28 Jay Taylor

Collatz Conjecture sequences increase and decrease in seemingly random fashion. By identifying and analyzing the forms of numbers, we discover that Collatz sequences are governed by very specific, well-defined rules, which we call cascades.

综合数学 · 数学 2022-09-14 H. Nelson Crooks , Chigozie Nwoke

The graph of zigzag diagrams is a close relative of Young's lattice. The boundary problem for this graph amounts to describing coherent random permutations with descent-set statistic, and is also related to certain positive characters on…

组合数学 · 数学 2007-05-23 Alexander Gnedin , Grigori Olshanski

The discrete acyclic convolution computes the 2n-1 sums sum_{i+j=k; (i,j) in [0,1,2,...,n-1]^2} (a_i b_j) in O(n log n) time. By using suitable offsets and setting some of the variables to zero, this method provides a tool to calculate all…

数据结构与算法 · 计算机科学 2019-10-28 Mitsuru Funakoshi , Julian Pape-Lange

We provide a programmable recursive algorithm for the $\mathbb{S}_n$-representations on the cohomology of the moduli spaces $\overline{\mathcal M}_{0,n}$ of $n$-pointed stable curves of genus 0. As an application, we find explicit inductive…

代数几何 · 数学 2024-08-21 Jinwon Choi , Young-Hoon Kiem , Donggun Lee

Given an alphabet $S$, we consider the size of the subsets of the full sequence space $S^{\rm {\bf Z}}$ determined by the additional restriction that $x_i\not=x_{i+f(n)},\ i\in {\rm {\bf Z}},\ n\in {\rm {\bf N}}.$ Here $f$ is a positive,…

概率论 · 数学 2015-03-20 Kari Eloranta

An involution of a real commutative algebra $A$ is a real-linear homomorphism $f : A \rightarrow A$ such that $f^2 = \mathrm{Id}$. We show that there are six involutions of the algebra of bicomplex numbers, contrary to the actual number of…

环与代数 · 数学 2022-08-04 Pierre-Olivier Parisé

We introduce the three-Catalan triangle, highlighting the three-Catalan numbers along with their recurrence relation and combinatorial interpretation, which allows us to establish their log-convexity. Additionally, we prove that the rows of…

组合数学 · 数学 2025-06-17 Boualam Rezig , Moussa Ahmia

The descent set D(w) of a permutation w of 1,2,...,n is a standard and well-studied statistic. We introduce a new statistic, the connectivity set C(w), and show that it is a kind of dual object to D(w). The duality is stated in terms of the…

组合数学 · 数学 2007-05-23 Richard P. Stanley
‹ 上一页 1 8 9 10 下一页 ›