中文
相关论文

相关论文: An Erd\H{o}s--Hajnal analogue for permutation clas…

200 篇论文

The concept of differential uniformity was recently extended to the $c$-differential uniformity. An interesting problem in this area is the construction of functions with low $c$-differential uniformity and a lot of research has been done…

信息论 · 计算机科学 2022-08-02 Mohit Pal

The simple permutations in two permutation classes --- the 321-avoiding permutations and the skew-merged permutations --- are enumerated using a uniform method. In both cases, these enumerations were known implicitly, by working backwards…

组合数学 · 数学 2013-01-15 Michael H. Albert , Vincent Vatter

Let $\mathbb{C}^{n+1}_o$ denote the germ of $\mathbb{C}^{n+1}$ at the origin. Let $V$ be a hypersurface germ in $\mathbb{C}^{n+1}_o$ and $W$ a deformation of $V$ over $\mathbb{C}_{o}^{m}$. Under the hypothesis that $W$ is a Newton…

代数几何 · 数学 2024-03-22 Maximiliano Leyton-Álvarez , Hussein Mourtada , Mark Spivakovsky

In this paper we look at polynomials arising from statistics on the classes of involutions, $I_n$, and involutions with no fixed points, $J_n$, in the symmetric group. Our results are motivated by F. Brenti's conjecture which states that…

组合数学 · 数学 2007-05-23 W. M. B. Dukes

The length is(w) of the longest increasing subsequence of a permutation w in the symmetric group S_n has been the object of much investigation. We develop comparable results for the length as(w) of the longest alternating subsequence of w,…

组合数学 · 数学 2007-05-23 Richard P. Stanley

A celebrated unresolved conjecture of Erd\H{o}s and Hajnal states that for every undirected graph $H$ there exists $\epsilon(H)>0$ such that every undirected graph on $n$ vertices that does not contain $H$ as an induced subgraph contains a…

组合数学 · 数学 2015-08-21 Eli Berger , Krzysztof Choromanski , Maria Chudnovsky

For a fixed graph $H$, what is the smallest number of colours $C$ such that there is a proper edge-colouring of the complete graph $K_n$ with $C$ colours containing no two vertex-disjoint colour-isomorphic copies, or repeats, of $H$? We…

组合数学 · 数学 2021-06-28 David Conlon , Mykhaylo Tyomkyn

Let $S_{n}$ denote the set of permutations of $[n]=\{1,2,\dots, n\}$. For a positive integer $k$, define $S_{n,k}$ to be the set of all permutations of $[n]$ with exactly $k$ disjoint cycles, i.e., \[ S_{n,k} = \{\pi \in S_{n}: \pi =…

组合数学 · 数学 2014-02-05 Cheng Yeaw Ku , Kok Bin Wong

We show that for any natural number $s$, there is a constant $\gamma$ and a subgraph-closed class having, for any natural $n$, at most $\gamma^n$ graphs on $n$ vertices up to isomorphism, but no adjacency labeling scheme with labels of size…

The celebrated Erdos-Hajnal conjecture states that for every $n$-vertex undirected graph $H$ there exists $\eps(H)>0$ such that every graph $G$ that does not contain $H$ as an induced subgraph contains a clique or an independent set of size…

We prove that constant minimum degree already forces cycles with almost linearly many chords. Specifically, every graph $G$ with $\delta(G)\ge C$ contains a cycle of length $\ell\ge 4$ with $\Omega(\ell/\log^{C}\ell)$ chords for some…

组合数学 · 数学 2026-01-14 Nemanja Draganić , António Girão

Given an infinite sequence of positive integers $\cA$, we prove that for every nonnegative integer $k$ the number of solutions of the equation $n=a_1+...+a_k$, $a_1,\,..., a_k\in \cA$, is not constant for $n$ large enough. This result is a…

数论 · 数学 2013-05-09 Juanjo Rué

A D-permutation is a permutation of $[2n]$ satisfying $2k-1 \le \sigma(2k-1)$ and $2k \ge \sigma(2k)$ for all $k$; they provide a combinatorial model for the Genocchi and median Genocchi numbers. We find Stieltjes-type and Thron-type…

组合数学 · 数学 2022-12-15 Bishal Deb , Alan D. Sokal

We give a direct straightforward proof that there is an isomorphism between the algebra of the Catalan monoid C_n that is, the monoid of all order-preserving, weakly increasing self-maps f of [n] = {1,...,n}, over any commutative ring with…

表示论 · 数学 2018-06-19 Stuart Margolis , Benjamin Steinberg

Let $A$ and $B$ be commutative algebras and $n\geqslant 2$ an integer. Then each $n-$ Jordan homomorphism $h:A\rightarrow B$ is an $n-$homomorphism.

环与代数 · 数学 2022-03-21 M. El Azhari

A classical theorem of Alexandroff states that every $n$-dimensional compactum $X$ contains an $n$-dimensional Cantor manifold. This theorem has a number of generalizations obtained by various authors. We consider extension-dimensional and…

一般拓扑 · 数学 2008-07-25 A. Karassev , P. Krupski , V. Todorov , V. Valov

Let $G$ be a topological group. We investigate relations between two classes of "polynomial like" continuous functions on $G$ defined, respectively, by the conditions (1) $\Delta_h^{n+1}f=0$ for every $h \in G$, and (2) $\Delta_{h_{n+1}}…

经典分析与常微分方程 · 数学 2017-09-26 J. M. Almira , E. V. Shulman

We characterize all orientations of cycles $C$ for which for every fixed $\varepsilon > 0$ there exists a constant $c \geq 1$ such that every digraph $D$ without loops or parallel arcs with $\chi(D) \geq c$ and minimum out-degree at least…

组合数学 · 数学 2025-03-27 Hidde Koerts , Benjamin Moore , Sophie Spirkl

Using a result of Longo and Xu, we show that the anomaly arising from a cyclic permutation orbifold of order 3 of a holomorphic conformal net $\mathcal A$ with central charge $c=8k$ depends on the "gravitational anomaly" $k\pmod 3$. In…

数学物理 · 物理学 2019-01-01 Marcel Bischoff

In a previous work, B\'ona and Pantone studied permutations that avoided all but one pattern of length $k$ that began with a length $k-1$ increasing subsequence. We draw the connection between that idea and distant patterns, first discussed…

组合数学 · 数学 2025-11-27 Nicholas Van Nimwegen