中文
相关论文

相关论文: Avoiding maximal parabolic subgroups of S_k

200 篇论文

Let $k$ be a number field, suppose that $B$ is a central simple division algebra over $k$, and choose any maximal order $\mathcal{D}$ of $B$. The object of this paper is to show that the group $\mathcal{D}_S^*$ of $S$-units of $B$ is…

数论 · 数学 2014-12-01 Ted Chinburg , Matthew Stover

We study generating functions in the context of Rota-Baxter algebras. We show that exponential generating functions can be naturally viewed in a very special case of complete free commutative Rota-Baxter algebras. This allows us to use free…

组合数学 · 数学 2015-10-15 Nancy Shanshan Gu , Li Guo

We show that a topologically generating set $S$ of a connected compact Lie group $G$ of size larger than a fixed polynomial in the rank of $G$ must be redundant (i.e., some proper subset of $S$ still topologically generates $G$). Similar…

群论 · 数学 2026-04-24 Tal Cohen , Itamar Vigdorovich

Let $G =<S>$ be a solvable permutation group of the symmetric group $S_n$ given as input by the generating set $S$. We give a deterministic polynomial-time algorithm that computes an \emph{expanding generating set} of size $\tilde{O}(n^2)$…

计算复杂性 · 计算机科学 2012-01-17 V. Arvind , Partha Mukhopadhyay , Prajakta Nimbhorkar , Yadu Vasudev

Several authors have examined connections among restricted permutations, continued fractions, and Chebyshev polynomials of the second kind. In this paper we prove analogues of these results for involutions which avoid 3412. Our results…

组合数学 · 数学 2007-05-23 Eric S. Egge

In this paper, we are interested in the moments of the characteristic polynomial $Z_n(x)$ of the $n\times n$ permutation matrices with respect to the uniform measure. We use a combinatorial argument to write down the generating function of…

概率论 · 数学 2010-07-14 Dirk Zeindler

A natural generalization of base B expansions is Zeckendorf's Theorem: every integer can be uniquely written as a sum of non-consecutive Fibonacci numbers $\{F_n\}$, with $F_{n+1} = F_n + F_{n-1}$ and $F_1=1, F_2=2$. If instead we allow the…

We describe a new method of producing equations for the canonical component of representation variety of a knot group into $PSL_2(\mathbb{C})$. Unlike known methods, this one does not involve any polyhedral decomposition or triangulation of…

几何拓扑 · 数学 2025-05-20 Kathleen L. Petersen , Anastasiia Tsvietkova

Considering commutator monomials of the non-commutative associative variables $X_1,\ldots,X_n$; we determine the maximal possible number of alternating associative monomials in their noncommutative polynomial expansions. This is achieved by…

组合数学 · 数学 2024-02-14 Gyula Lakos

Building on prior work, we analyze the decomposition of the restriction of an irreducible representation of SL_2(k), for k a p-adic field of odd residual characteristic, to a maximal compact subgroup K. The pattern of the decomposition…

表示论 · 数学 2012-06-05 Monica Nevins

Fix a finite semigroup $S$ and let $a_1,\ldots,a_k, b$ be tuples in a direct power $S^n$. The subpower membership problem (SMP) for $S$ asks whether $b$ can be generated by $a_1,\ldots,a_k$. For bands (idempotent semigroups), we provide a…

群论 · 数学 2016-04-06 Markus Steindl

We present a short, direct proof of the fact that the generating function of all permutations of a fixed length $n\geq 4$ is divisible by $(1+z)^m$, where $m=\lfloor (n-2)/2 \rfloor$.

组合数学 · 数学 2020-05-27 Miklós Bóna

A group obtained from a nontrivial group by adding one generator and one relator which is a proper power of a word in which the exponent-sum of the additional generator is one contains the free square of the initial group and almost always…

群论 · 数学 2015-03-17 Anton A. Klyachko , Denis E. Lurye

It is described the group of arrowy permutations (that is extension of symmetric group) and the consequent process of generation of GL(n) and some its subgroups by this combinatoric group and its subgroups.

综合数学 · 数学 2007-05-23 I. V. Bayak

We give an improved algorithm for counting the number of $1324$-avoiding permutations, resulting in $14$ further terms of the generating function, which is now known for all patterns of length $\le 50$. We re-analyse the generating function…

组合数学 · 数学 2017-11-21 Andrew R. Conway , Anthony J. Guttmann , Paul Zinn-Justin

A superpermutation is a sequence that contains every permutation of $n$ distinct symbols as a contiguous substring. For instance, a valid example for three symbols is a sequence that contains all six permutations. This paper introduces a…

离散数学 · 计算机科学 2025-05-19 Dhruv Ajmera

Using methods from Analytic Combinatorics, we study the families of perfect matchings, partitions, chord diagrams, and hyperchord diagrams on a disk with a prescribed number of crossings. For each family, we express the generating function…

组合数学 · 数学 2023-11-14 Vincent Pilaud , Juanjo Rué

In this paper we consider the representation theory of N=1 Super-W-algebras with two generators for conformal dimension of the additional superprimary field between two and six. In the superminimal case our results coincide with the…

高能物理 - 理论 · 物理学 2015-02-03 W. Eholzer , A. Honecker , R. Huebel

We consider the problem of discovering subgroup $H$ of permutation group $S_{n}$. Unlike the traditional $H$-invariant networks wherein $H$ is assumed to be known, we present a method to discover the underlying subgroup, given that it…

机器学习 · 计算机科学 2023-09-12 Pavan Karjol , Rohan Kashyap , Prathosh A P

Let $G$ be a subgroup of $S_n$, the symmetric group of degree $n$. For any field $k$, $G$ acts naturally on the rational function field $k(x_1,x_2,\ldots,x_n)$ via $k$-automorphisms defined by $\sigma\cdot x_i=x_{\sigma(i)}$ for any…

代数几何 · 数学 2013-08-05 Ming-chang Kang , Baoshan Wang