中文
相关论文

相关论文: Ordinal and disjoint sums of partially ordered pat…

200 篇论文

The partition problem is a well-known basic NP-complete problem. We mainly consider the optimization version of it in this paper. The problem has been investigated from various perspectives for a long time and can be solved efficiently in…

离散数学 · 计算机科学 2024-05-10 Susumu Kubo

Let D_v the difference operator and q-difference operators defined by D_\omega p(x) = \frac{p(x+\omega)-p(x)}{\omega} and D_q p(x) = \frac{p(qx)-p(x)}{(q-1)x}, respectively. Let U and V be two moment regular linear functionals and let…

经典分析与常微分方程 · 数学 2014-07-02 R. Alvarez-Nodarse , J. Petronilho , N. C. Pinzon-Cortes , R. Sevinik-Adiguzel

We derive explicit formulas for the normal ordering of powers of arbitrary monomials of boson operators. These formulas lead to generalisations of conventional Bell and Stirling numbers and to appropriate generalisations of the Dobinski…

量子物理 · 物理学 2007-05-23 Karol A. Penson , Allan I. Solomon

We present two fully mechanized proofs of Dilworths and Mirskys theorems in the Coq proof assistant. Dilworths Theorem states that in any finite partially ordered set (poset), the size of a smallest chain cover and a largest antichain are…

计算机科学中的逻辑 · 计算机科学 2017-03-20 Abhishek Kr Singh

In this note we study order reversing quasi involutions and their properties. These maps are dualities (order reversing involutions) on their image. We prove that any order reversing quasi involution is induced by a cost. Invariant sets of…

度量几何 · 数学 2022-11-07 Shiri Artstein-Avidan , Shay Sadovsky , Katarzyna Wyczesany

For a set of permutation patterns $\Pi$, let $F^\text{st}_n(\Pi,q)$ be the st-polynomial of permutations avoiding all patterns in $\Pi$. Suppose $312\in\Pi$. For a class of permutation statistics which includes inversion and descent…

组合数学 · 数学 2013-09-13 Wuttisak Trongsiriwat

We introduce Lipschitz functions on a finite partially ordered set $P$ and study the associated Lipschitz polytope $L(P)$. The geometry of $L(P)$ can be described in terms of descent-compatible permutations and permutation statistics that…

组合数学 · 数学 2017-03-31 Raman Sanyal , Christian Stump

We prove a normal form theorem for Poisson structures around Poisson transversals (also called cosymplectic submanifolds), which simultaneously generalizes Weinstein's symplectic neighborhood theorem from symplectic geometry and Weinstein's…

辛几何 · 数学 2017-04-12 Pedro Frejlich , Ioan Marcut

The class of permutations that avoid the bivincular pattern (231, {1},{1}) is known to be enumerated by the Fishburn numbers. In this paper, we call them Fishburn permutations and study their pattern avoidance. For classical patterns of…

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

In this paper, we first give formulas for the order polynomial $\Omega (\Pw; t)$ and the Eulerian polynomial $e(\Pw; \lambda)$ of a finite labeled poset $(P, \omega)$ using the adjacency matrix of what we call the $\omega$-graph of $(P,…

组合数学 · 数学 2007-05-23 John Shareshian , David Wright , Wenhua Zhao

In this note, an upper bound for the sum of fractional parts of certain smooth functions is established. Such sums arise naturally in numerous problems of analytic number theory. The main feature is here an improvement of the main term due…

数论 · 数学 2019-01-03 Olivier Bordellès

Motivated by a correlation between the distribution of descents over permutations that avoid a consecutive pattern and those avoiding the respective quasi-consecutive pattern, as established in this paper, we obtain a complete $\des$-Wilf…

组合数学 · 数学 2025-02-17 Yan Wang , Qi Fang , Shishuo Fu , Sergey Kitaev , Haijun Li

In this paper we consider the following conjecture, proposed by Brian Alspach, concerning partial sums in finite cyclic groups: given a subset $A$ of $\mathbb{Z}_n\setminus \{0\}$ of size $k$ such that $\sum_{z\in A} z\not= 0$, it is…

组合数学 · 数学 2020-04-24 Simone Costa , Marco Antonio Pellegrini

Partial Markov categories are a recent framework for categorical probability theory that provide an abstract account of partial probabilistic computation with updating semantics. In this article, we discuss two order relations on the…

计算机科学中的逻辑 · 计算机科学 2026-03-03 Elena Di Lavore , Mario Román , Paweł Sobociński , Márk Széles

The purpose of this note is to prove the existence of a remarkable structure in an iterated sumset derived from a set $P$ in a Cartesian square $\mathbb{F}_p^n\times\mathbb{F}_p^n$. More precisely, we perform horizontal and vertical sums…

组合数学 · 数学 2018-08-09 Pierre-Yves Bienvenu , Thái Hoàng Lê

In this paper, we consider the family of pattern-replacement equivalence relations referred to as the "indices and values adjacent" case. Each such equivalence is determined by a partition $P$ of a subset of $S_c$ for some $c$. In 2010,…

组合数学 · 数学 2014-03-04 William Kuszmaul

We study a surprising phenomenon related to the representation of a cloud of data points using polynomials. We start with the previously unnoticed empirical observation that, given a collection (a cloud) of data points, the sublevel sets of…

机器学习 · 计算机科学 2016-06-15 Jean-Bernard Lasserre , Edouard Pauwels

We prove that the set of patterns {1324,3416725} is Wilf-equivalent to the pattern 1234 and that the set of patterns {2143,3142,246135} is Wilf-equivalent to the set of patterns {2413,3142}. These are the first known unbalanced…

组合数学 · 数学 2014-10-01 Alexander Burstein , Jay Pantone

Skew-orthogonal polynomials (SOPs) arise in the study of the n-point distribution function for orthogonal and symplectic random matrix ensembles. Motivated by the average of characteristic polynomials of the Bures random matrix ensemble…

数学物理 · 物理学 2018-11-14 Xiang-Ke Chang , Yi He , Xing-Biao Hu , Shi-Hao Li

Let $P$ be a partially ordered set and consider the free monoid $P^*$ of all words over $P$. If $w,w'\in P^*$ then $w'$ is a factor of $w$ if there are words $u,v$ with $w=uw'v$. Define generalized factor order on $P^*$ by letting $u\le w$…

组合数学 · 数学 2008-06-24 Sergey Kitaev , Jeffrey Liese , Jeffrey Remmel , Bruce E. Sagan