Related papers: An Inversion Statistic on the Hyperoctahedral Grou…
We define the excedance number on the complex reflection groups and compute its multidistribution with the number of fixed points on the set of involutions in these groups. We use some recurrence formulas and generating functions…
We consider families of exponential sums indexed by a subgroup of invertible classes modulo some prime power $q$. For fixed $d$, we restrict to moduli $q$ so that there is a unique subgroup of invertible classes modulo $q$ of order $d$. We…
In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…
Let n>0 be an integer and let B_{n} denote the hyperoctahedral group of rank n. The group B_{n} acts on the polynomial ring Q[x_{1},...,x_{n},y_{1},...,y_{n}] by signed permutations simultaneously on both of the sets of variables…
A novel numerical method for solving inverse scattering problem with fixed-energy data is proposed. The method contains a new important concept: the stability index of the inversion problem. This is a number, computed from the data, which…
Deconvolution is a statistical inverse problem to estimate the distribution of a random variable based on its noisy observations. Despite the extensive studies on the topic, deconvolution with unknown noise distribution remains as a…
We study the problem of signal recovery in the dihedral multi-reference alignment (MRA) model, where a signal is observed under random actions of the dihedral group and corrupted by additive noise. While previous has shown that cyclic…
Graph reordering is a powerful technique to increase the locality of the representations of graphs, which can be helpful in several applications. We study how the technique can be used to improve compression of graphs and inverted indexes.…
An oriented hypergraph is an oriented incidence structure that allows for the generalization of graph theoretic concepts to integer matrices through its locally signed graphic substructure. The locally graphic behaviors are formalized in…
The study of pinnacle sets has been a recent area of interest in combinatorics. Given a permutation, its pinnacle set is the set of all values larger than the values on either side of it. Largely inspired by conjectures posed by Davis,…
Hyperoctahedral homology is the homology theory associated to the hyperoctahedral crossed simplicial group. It is defined for involutive algebras over a commutative ring using functor homology and the hyperoctahedral bar construction of…
We give an efficient algorithm for the enumeration up to isomorphism of the inverse semigroups of order n, and we count the number S(n) of inverse semigroups of order n<=15. This improves considerably on the previous highest-known value…
We show that a classical uniformly distributed phenomenon for an element and its inverse in ($\mathbb{Z}/n\mathbb{Z})^{*}$ also exists in $\textrm{GL}_{n}(\mathbb{F}_{p})$. A $\textrm{GL}_{n}(\mathbb{F}_{p})$ analogy of the uniform…
We reinterpret an inequality, due originally to Sidorenko, for linear extensions of posets in terms of convex subsets of the symmetric group $\mathfrak{S}_n$. We conjecture that the analogous inequalities hold in arbitrary…
We consider a bivariate polynomial that generalizes both the length and reflection length generating functions in a finite Coxeter group. In seeking a combinatorial description of the coefficients, we are led to the study of a new Mahonian…
$O(N)$ invariants are the observables of real tensor models. We use regular colored graphs to represent these invariants, the valence of the vertices of the graphs relates to the tensor rank. We enumerate $O(N)$ invariants as $d$-regular…
By using the notion of wavelength- and angle-averaged reflectance, we assess in a systematic way the performance of finite omnidirectional reflectors. We put forward how this concept can be employed to optimize omnidirectional capabilities.…
The extension of majorization (also called the rearrangement ordering), to more general groups than the symmetric (permutation) group, is referred to as $G$-majorization. There are strong results in the case that $G$ is a reflection group…
We consider a random walk on the hyperoctahedral group $B_n$ generated by the signed permutations of the forms $(i,n)$ and $(-i,n)$ for $1\leq i\leq n$. We call this the flip-transpose top with random shuffle on $B_n$. We find the spectrum…
In this paper, we compute the $RO(C_n)$-graded coefficient ring of equivariant cohomology for cyclic groups $C_n$, in the case of Burnside ring coefficients, and in the case of constant coefficients. We use the invertible Mackey functors…