中文
相关论文

相关论文: Variants of Schroeder Dissections

200 篇论文

We prove a generalization of a conjecture of Dokos, Dwyer, Johnson, Sagan, and Selsor giving a recursion for the inversion polynomial of 321-avoiding permutations. We also answer a question they posed about finding a recursive formulas for…

组合数学 · 数学 2012-11-21 Szu-En Cheng , Sergi Elizalde , Anisse Kasraoui , Bruce Sagan

We enumerate total cyclic orders on $\left\{1,\ldots,n\right\}$ where we prescribe the relative cyclic order of consecutive triples $(i,{i+1},{i+2})$, these integers being taken modulo $n$. In some cases, the problem reduces to the…

组合数学 · 数学 2020-07-10 Sanjay Ramassamy

We present several bijections, in terms of combinatorial objects counted by the Schr\"oder numbers, that are then used (via coloring) for the construction and enumeration of rational Schr\"oder paths with integer slope, ordered rooted…

组合数学 · 数学 2022-03-15 Daniel Birmajer , Juan B. Gil , Juan D. Gil , Michael D. Weiner

We describe an approach to finding a bijection between Alternating Sign Matrices and Totally Symmetric Self-Complementary Plane Partitions, which is based on the Schutzenberger involution. In particular we give an explicit bijection between…

组合数学 · 数学 2011-05-26 Hayat Cheballah , Philippe Biane

We present an atlas of Legendrian knots in standard contact three-space. This gives a conjectural Legendrian classification for all knots with arc index at most 9, including alternating knots through 7 crossings and nonalternating knots…

辛几何 · 数学 2013-05-08 Wutichai Chongchitmate , Lenhard Ng

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

Given a surface with boundary and some points on its boundary, a polygon diagram is a way to connect those points as vertices of non-overlapping polygons on the surface. Such polygon diagrams represent non-crossing permutations on a surface…

组合数学 · 数学 2019-09-27 Norman Do , Jian He , Daniel V. Mathews

S-Motzkin paths (bijective to ternary trees) and partial version of them are calculated using only elementary methods from linear algebra.

组合数学 · 数学 2021-06-15 Helmut Prodinger

We present an approach to proving the 2-log-convexity of sequences satisfying three-term recurrence relations. We show that the Apery numbers, the Cohen-Rhin numbers, the Motzkin numbers, the Fine numbers, the Franel numbers of order 3 and…

组合数学 · 数学 2010-09-14 William Y. C. Chen , Ernest X. W. Xia

We give examples of a linear combination of algebraic knots and their mirrors that are algebraically slice, but whose topological and smooth four-genus is two. Our examples generalize an example of non-slice algebraically slice linear…

几何拓扑 · 数学 2023-08-10 Maria Marchwicka , Wojciech Politarczyk

We study orthogonal decompositions of symmetric and ordinary tensors using methods from linear algebra. For the field of real numbers we show that the sets of decomposable tensors can be defined be equations of degree 2. This gives a new…

环与代数 · 数学 2019-10-01 Pascal Koiran

We compute the number of triangulations of a convex $k$-gon each of whose sides is subdivided by $r-1$ points. We find explicit formulas and generating functions, and we determine the asymptotic behaviour of these numbers as $k$ and/or $r$…

组合数学 · 数学 2017-02-06 Andrei Asinowski , Christian Krattenthaler , Toufik Mansour

There is the classical Radon theorem. Given integer $d \geq 1$ and $d+2$ points in d-dimensional space $R^d$. Then these points can be divided into two disjoint subsets whose convex hulls have a non-empty intersection. The original proof of…

度量几何 · 数学 2019-03-28 Egor Kolpakov

We define a triangular change of basis in which the form is diagonal and explicitly compute the diagonal entries of this matrix as products of quotients of Chebyshev polynomials, corroborating the determinant computation of Ko and…

量子代数 · 数学 2007-05-23 Josh Genauer , Neal W. Stoltzfus

We consider a sorting machine consisting of two stacks in series where the first stack has the added restriction that entries in the stack must be in decreasing order from top to bottom. The class of permutations sortable by this machine…

组合数学 · 数学 2023-06-22 Michael W. Schroeder , Rebecca Smith

We formulate the following general problem. To the best of our knowledge, it is open and has not previously been considered. It seems (at least to us!) to be difficult; at any rate, more difficult than enumerating the dissections…

组合数学 · 数学 2022-02-02 Charles H Conley , Valentin Ovsienko

The manuscripts tabulates arc lists of the 1, 1, 3, 8, 25, 85, 397 ... unlabeled 2-regular digraphs on n=0, 1, 2, ..., 9 nodes, including disconnected graphs, graphs with multiarcs and/or graphs with loops. Each of these graphs represents…

综合数学 · 数学 2023-02-28 Richard J. Mathar

From the matrix point of view, we use the recursion to discuss four combinatorial numbers in terms of the integer lattice paths, this is different from Andr\'a's method (Andra). We give four tables and matrices, and their relations, and…

组合数学 · 数学 2016-09-23 Jishe Feng

We define and study odd analogues of classical geometric and combinatorial objects associated to permutations, namely odd Schubert varieties, odd diagrams, and odd inversion sets. We show that there is a bijection between odd inversion sets…

组合数学 · 数学 2020-06-24 Francesco Brenti , Angela Carnevale

We consider non-commutative deformations of sheaves on algebraic varieties. We develop some tools to determine parameter algebras of versal non-commutative deformations for partial simple collections and the structure sheaves of smooth…

代数几何 · 数学 2021-08-31 Yujiro Kawamata