首页/论文/1908.03739

arXiv 1908.037392019-08-10math.CO

Permutation Matrices, Their Discrete Derivatives and Extremal Properties

Richard A. Brualdi, Geir Dahl

英文摘要：

For a permutation $π$, and the corresponding permutation matrix, we introduce the notion of {\em discrete derivative}, obtained by taking differences of successive entries in $π$. We characterize the possible derivatives of permutations, and consider questions for permutations with certain properties satisfied by the derivative. For instance, we consider permutations with distinct derivatives, and the relationship to so-called Costas arrays.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Permutations with Extremal number of Fixed Points

We extend Stanley's work on alternating permutations with extremal number of fixed points in two directions: first, alternating permutations are replaced by permutations with a prescribed descent set; second, instead of simply counting permutations we study their generating polynomials by number of excedances. Several techniques are used: Desarmenien's desarrangement combinatorics, Gessel's hook-factorization and the analytical properties of two new permutation statistics "DEZ" and "lec". Explicit formulas for the maximal case are derived by using symmetric function tools.

2007-06-22math.CO

Extremal permutations in routing cycles

Let $G$ be a graph on $n$ vertices, labeled $v_1,\ldots,v_n$ and $π$ be a permutation on $[n]:=\{1,2,\cdots, n\}$. Suppose that each pebble $p_i$ is placed at vertex $v_{π(i)}$ and has destination $v_i$. During each step, a disjoint set of edges is selected and the pebbles on each edge are swapped. Let $rt(G, π)$, the routing number for $π$, be the minimum number of steps necessary for the pebbles to reach their destinations. Li, Lu, and Yang prove that $rt(C_n, π)\le n-1$ for any permutation on $n$-cycle $C_n$ and conjecture that for $n \geq 5$, if $rt(C_n, π) = n-1$, then $π= (123\cdots n)$ …

2016-08-31math.CO

大 $t$ 下极值 $t$-相交置换族

Extremal $t$-intersecting Families of Permutations for Large $t$

研究大 $t$ 下最大 $t$-相交置换族的分类，通过改进 Kupavskii 的 spread 近似技术，将结论适用范围扩展到 $t\leq n-n^{5/7+\varepsilon}$。

2026-05-25math.CO

从代金券谜题到相邻乘积的极值

From a Voucher Puzzle to Extremal Sums of Adjacent Products

PRIMES STEP；MIT（麻省理工学院）

受自指谜题启发，研究代金券价格序列中每次选择影响后续成本的问题，通过引入代金券成本及相关成本，将预算问题转化为排列上的极值问题，并推广到任意不同非负价格集。

2026-06-16math.CO

Derivative polynomials and enumeration of permutations by their alternating descents

In this paper we present an explicit formula for the number of permutations with a given number of alternating descents. Moreover, we study the interlacing property of the real parts of the zeros of the generating polynomials of these numbers.

2015-04-09math.CO

排列中匹配的极值族

Extremal Families for Matchings in Permutations

Institute for Mathematical Sciences, Renmin University of China（中国人民大学数学科学研究所）；Department of Mathematical Sciences, Tsinghua University（清华大学数学科学系）

本文在2≤s≤n的全范围刻画了排列族不含s个两两不相交排列时的极值等号情形，证明该情形等价于族为(s-1)个两两不相交1-陪集的并集，并给出相关线性命题的组合证明。

2026-09-04math.CO

更多相关论文收起更多论文

Derivative polynomials and permutations by numbers of interior peaks and left peaks

Derivative polynomials in two variables are defined by repeated differentiation of the tangent and secant functions. We establish the connections between the coefficients of these derivative polynomials and the numbers of interior and left peaks over the symmetric group. Properties of the generating functions for the numbers of interior and left peaks over the symmetric group, including recurrence relations, generating functions and real-rootedness, are studied.

2011-11-25math.CO

Improved lower bounds on extremal functions of multidimensional permutation matrices

A $d$-dimensional zero-one matrix $A$ avoids another $d$-dimensional zero-one matrix $P$ if no submatrix of $A$ can be transformed to $P$ by changing some ones to zeroes. Let $f(n,P,d)$ denote the maximum number of ones in a $d$-dimensional $n \times \cdots \times n$ zero-one matrix that avoids $P$. Fox proved for $n$ sufficiently large that $f(n, P, 2) = 2^{k^{Θ(1)}}n$ for almost all $k \times k$ permutation matrices $P$. We extend this result by proving for $d \geq 2$ and $n$ sufficiently large that $f(n, P, d) = 2^{k^{Θ(1)}}n^{d-1}$ for almost all $d$-dimensional permutation matrices $P$ of…

2015-06-28cs.DMmath.CO

Asymptotics of the Extremal Excedance Set Statistic

Answering a question of Clark and Ehrenborg (2010), we determine asymptotics for the number of permutations of size n that admit the most common excedance set. In fact, we provide a more general bivariate asymptotic using the multivariate asymptotic methods of R. Pemantle and M. C. Wilson. We also consider two applications of our main result. First, we determine asymptotics on the number of permutations of size n which simultaneously avoid the generalized patterns 21-34 and 34-21. Second, we determine asymptotics on the number of n-cycles that admit no stretching pairs.

2016-05-27math.CO

Extremal Functions of Forbidden Multidimensional Matrices

Pattern avoidance is a central topic in graph theory and combinatorics. Pattern avoidance in matrices has applications in computer science and engineering, such as robot motion planning and VLSI circuit design. A $d$-dimensional zero-one matrix $A$ avoids another $d$-dimensional zero-one matrix $P$ if no submatrix of $A$ can be transformed to $P$ by changing some ones to zeros. A fundamental problem is to study the maximum number of nonzero entries in a $d$-dimensional $n \times \cdots \times n$ matrix that avoids $P$. This maximum number, denoted by $f(n,P,d)$, is called the extremal function…

2015-06-11cs.DMmath.CO

通过极值组合学改进排列问题的空间-时间折衷

Improved Space-Time Tradeoffs for Permutation Problems via Extremal Combinatorics

Utrecht University（乌得勒支大学）

本文通过极值组合学引入链效率参数，改进了排列问题的空间-时间折衷，解决了旅行商问题并推翻了Johnson等人的猜想。

2026-07-13cs.DMcs.DSmath.CO

Signed Countings of Type B and D Permutations and $t,q$-Euler numbers

A classical result states that the parity balance of the number of excedances of all permutations (derangements, respectively) of length $n$ is the Euler number. In 2010, Josuat-Vergès gives a $q$-analogue with $q$ representing the number of crossings. We extend this result to the permutations (derangements, respectively) of type B and D. It turns out that the signed countings are related to the derivative polynomials of $\tan$ and $\sec$. Springer numbers defined by Springer can be regarded as an analogue of Euler numbers defined on every Coxeter group. In 1992 Arnol'd showed that the Springe…

2020-06-13math.CO

超图匹配的埃尔德什 - 柯 - 拉多型问题

Erdős-Ko-Rado-type problem for hypergraph matchings

School of Mathematics and Statistics, Beijing Jiaotong University（北京交通大学数学与统计学院）；Hebei Provincial Key Laboratory of Mathematical Theory and Analysis for Network and Data Science, Beijing Jiaotong University（北京交通大学网络与数据科学数学理论与分析河北省重点实验室）；School of Mathematics and Statistics, Ningbo University（宁波大学数学与统计学院）；Institute of Mathematics and Interdisciplinary Sciences, Xidian University（西安电子科技大学数学与交叉科学研究院）

研究完全$r$部$r$均匀超图中$k$匹配的$t$相交族问题，用两种方法确定其最大规模并刻画极值族，一种借助排列的$t$相交族结果得定理，另一种基于$t$覆盖法进行补充刻画。

2026-07-17math.CO

精确禁止配置的界限及极值矩阵

Exact Bounds for Forbidden Configurations and the Extremal Matrices

本文研究了禁止特定配置的矩阵极值问题，确定了特定配置下的最大列数，并刻画了极值矩阵的构造方法。

2026-01-07math.CO

Intersecting families of discrete structures are typically trivial

The study of intersecting structures is central to extremal combinatorics. A family of permutations $\mathcal{F} \subset S_n$ is \emph{$t$-intersecting} if any two permutations in $\mathcal{F}$ agree on some $t$ indices, and is \emph{trivial} if all permutations in $\mathcal{F}$ agree on the same $t$ indices. A $k$-uniform hypergraph is \emph{$t$-intersecting} if any two of its edges have $t$ vertices in common, and \emph{trivial} if all its edges share the same $t$ vertices. The fundamental problem is to determine how large an intersecting family can be. Ellis, Friedgut and Pilpel proved that…

2015-01-09math.CO

Forbidden formations in 0-1 matrices

Keszegh (2009) proved that the extremal function $ex(n, P)$ of any forbidden light $2$-dimensional 0-1 matrix $P$ is at most quasilinear in $n$, using a reduction to generalized Davenport-Schinzel sequences. We extend this result to multidimensional matrices by proving that any light $d$-dimensional 0-1 matrix $P$ has extremal function $ex(n, P,d) = O(n^{d-1}2^{α(n)^{t}})$ for some constant $t$ that depends on $P$. To prove this result, we introduce a new family of patterns called $(P, s)$-formations, which are a generalization of $(r, s)$-formations, and we prove upper bounds on their extrema…

2018-05-13cs.DMmath.CO