Related papers: Odd length: odd diagrams and descent classes

A permutation sigma in Sn is a k-derangement if for any subset X = {a1, . . ., ak} \subseteq [n], {sigma(a1), . . ., sigma(ak)} is not equal to X. One can form the k-derangement graph on the set of permutations of Sn by connecting two…

Permutations that avoid given patterns have been studied in great depth for their connections to other fields of mathematics, computer science, and biology. From a combinatorial perspective, permutation patterns have served as a unifying…

Selecting N random points in a unit square corresponds to selecting a random permutation. By putting 5 types of symmetry restrictions on the points, we obtain subsets of permutations : involutions, signed permutations and signed…

The divergence-like operator on an odd symplectic superspace which acts invariantly on a specially chosen odd vector field is considered. This operator is used to construct an odd invariant semidensity in a geometrically clear way. The…

We describe the rings of invariants for the finite orthogonal groups of plus type in odd characteristic acting on the defining representations. We also describe the invariants of the corresponding Sylow subgroups in the defining…

We study joint distributions of cycles and patterns in permutations written in standard cycle form. We explore both classical and generalised patterns of length 2 and 3. Many extensions of classical theory are achieved; bivariate generating…

We investigate a family of one dimensional maps for which the bifurcation diagram looks differently than the usual ones. We describe and exemplify various unique and interesting phenomena arising for this family of maps.

Comparing the bounded derived categories of an algebra and of the endomorphism algebra of a given support {\tau}-tilting module, we find a relation between the derived dimensions of an algebra and of the endomorphism algebra of a given…

Let $G$ be a transitive permutation group of degree $n$. We say that $G$ is $2'$-elusive if $n$ is divisible by an odd prime, but $G$ does not contain a derangement of odd prime order. In this paper we study the structure of quasiprimitive…

In order to study signed Eulerian numbers, we introduce permutations of a particular type, called parity-alternate permutations, because they take even and odd entries alternately. The objective of this paper is twofold. The first is to…

In this talk we present some links of the theory of the odderon with elliptic curves. These results were obtained in an earlier work \cite{RJ}. The natural degrees of freedom of the odderon turn out to coincide with conformal invariants of…

We enumerate permutations that avoid all but one of the $k$ patterns of length $k$ starting with a monotone increasing subsequence of length $k-1$. We compare the size of such permutation classes to the size of the class of permutations…

Group algebras of permutations have proved highly useful in solving a number of problems in large N gauge theories. I review the use of permutations in classifying gauge invariants in one-matrix and multi-matrix models and computing their…

An odd wheel graph is a graph formed by connecting a new vertex to all vertices of an odd cycle. We answer a question of Rosenfeld and Le by showing that odd wheels cannot be drawn in the plane such that the lengths of the edges are odd…

We study almost symmetric semigroups generated by odd integers. If the embedding dimension is four, we characterize when a symmetric semigroup that is not complete intersection or a pseudo-symmetric semigroup is generated by odd integers.…

Given a quandle, we can construct a symmetric quandle called the symmetric double of the quandle. We show that the (co)homology groups of a given quandle are isomorphic to those of its symmetric double. Moreover, quandle coloring numbers…

We introduce an odd version of the nilHecke algebra and develop an odd analogue of the thick diagrammatic calculus for nilHecke algebras. We graphically describe idempotents which give a Morita equivalence between odd nilHecke algebras and…

A permutation is centrosymmetric if it is fixed by a half-turn rotation of its diagram. Initially motivated by a question by Alexander Woo, we investigate the question of whether the growth rate of a permutation class equals the growth rate…

The work examines norms in of fundamental trigonometric splines of odd and even degrees, which in some cases coincide with polynomial ones. Fundamental trigonometric splines for the case where the con-vergence factors depend on the…

For $\sigma \in S_n$, let $D(\sigma) = \{i : \sigma_{i} > \sigma_{i+1}\}$ denote the descent set of $\sigma$. The length of the permutation is the number of inversions, denoted by $inv(\sigma) = \big | \{(i,j) : i<j, \sigma_i > \sigma_j\}…