Results 51 to 60 of about 57,503 (225)

Bruhat interval polytopes [PDF]

Discrete Mathematics & Theoretical Computer Science, 2015
Let $u$ and $v$ be permutations on $n$ letters, with $u$ ≤ $v$ in Bruhat order. A Bruhat interval polytope $Q_{u,v}$ is the convex hull of all permutation vectors $z=(z(1),z(2),...,z(n))$ with $u$ ≤ $z$ ≤ $v$.
Emmanuel Tsukerman, Lauren Williams
doaj   +1 more source

Differential uniformity properties of some classes of permutation polynomials [PDF]

, 2022
Kirpa Garg, Sartaj Ul Hasan, Pantelimon Stănică   +2 more
openalex   +1 more source

Permutation Tutte polynomial

European Journal of Combinatorics
The classical Tutte polynomial is a two-variate polynomial $T_G(x,y)$ associated to graphs or more generally, matroids. In this paper, we introduce a polynomial $\widetilde{T}_H(x,y)$ associated to a bipartite graph $H$ that we call the permutation Tutte polynomial of the graph $H$.
Beke, Csongor, Csáji, Gergely Kál, Csikvári, Péter, Pituk, Sára   +3 more
openaire   +3 more sources

Linearized polynomials and permutation polynomials of finite fields.

Michigan Mathematical Journal, 1992
Let \(F_ q\) denote the finite field of order \(q=p^ m\) with \(m\geq 1\) and \(p\) is prime. A polynomial \(f\in F_ q[x]\) is called a permutation polynomial (PP) of \(F_ q\) if the mapping induced on \(F_ q\) by \(f\) is a bijection. Among other results, the authors prove that if \(f\in F_ q[x]\) with \(\deg(f)
Evans, Ronald J., Greene, John, Niederreiter, Harald   +2 more
openaire   +3 more sources

Wreath Macdonald operators

Forum of Mathematics, Sigma
We construct a novel family of difference-permutation operators and prove that they are diagonalized by the wreath Macdonald P-polynomials; the eigenvalues are written in terms of elementary symmetric polynomials of arbitrary degree.
Daniel Orr, Mark Shimozono, Joshua Wen
doaj   +1 more source

Generalized triangulations, pipe dreams, and simplicial spheres [PDF]

Discrete Mathematics & Theoretical Computer Science, 2011
We exhibit a canonical connection between maximal $(0,1)$-fillings of a moon polyomino avoiding north-east chains of a given length and reduced pipe dreams of a certain permutation.
Luis Serrano, Christian Stump
doaj   +1 more source

Permutation-invariant qudit codes from polynomials

, 2017
A permutation-invariant quantum code on $N$ qudits is any subspace stabilized by the matrix representation of the symmetric group $S_N$ as permutation matrices that permute the underlying $N$ subsystems.
Ouyang, Yingkai
core   +1 more source

On generalized Melvin solution for the Lie algebra $$E_6$$ E6

European Physical Journal C: Particles and Fields, 2017
A multidimensional generalization of Melvin’s solution for an arbitrary simple Lie algebra $${\mathcal {G}}$$ G is considered. The gravitational model in D dimensions, $$D \ge 4$$ D≥4 , contains n 2-forms and $$l \ge n$$ l≥n scalar fields, where n is the
S. V. Bolokhov, V. D. Ivashchuk
doaj   +1 more source

Parabolic Catalan numbers count flagged Schur functions and their appearances as type A Demazure characters (key polynomials) [PDF]

Discrete Mathematics & Theoretical Computer Science, 2017
Fix an integer partition lambda that has no more than n parts. Let beta be a weakly increasing n-tuple with entries from {1,..,n}. The flagged Schur function indexed by lambda and beta is a polynomial generating function in x_1, .., x_n for certain ...
Robert A. Proctor, Matthew J. Willis
doaj   +1 more source

Double cover of modular S4 for flavour model building

Nuclear Physics B, 2021
We develop the formalism of the finite modular group Γ4′≡S4′, a double cover of the modular permutation group Γ4≃S4, for theories of flavour. The integer weight k>0 of the level 4 modular forms indispensable for the formalism can be even or odd.
P.P. Novichkov, J.T. Penedo, S.T. Petcov
doaj   +1 more source