Results 51 to 60 of about 103,432 (283)
Permutation Polynomials Modulo 2w
The author explicitly characterizes permutation polynomials modulo \(2^n\) for \(n\geq 2\). In addition, he proves that pairs of polynomials defining a pair of orthogonal Latin squares (modulo \(2^n\)) do not exist.
openaire +2 more sources
Tree snumeration polynomials on separable permutations
Summary: \textit{I. M. Pak} and \textit{A. E. Postnikov} [Russ. Math. Surv. 45, No. 3, 220--221 (1990; Zbl 0744.05020); translation from Usp. Mat. Nauk 45, No. 3(273), 193--194 (1990)] introduced a tree enumeration polynomial \(f_G\) on graphs, as a multivariate generalization of Cayley's formula, and demonstrated an amazing reciprocity property.
Yibo Gao, Siyu Liu
openaire +2 more sources
Imaging of Biphoton States: Fundamentals and Applications
Quantum states of two photons exhibit a rich polarization and spatial structure, which provides a fundamental resource of strongly correlated and entangled states. This review analyzes the physics of these intriguing properties and explores the various techniques and technologies available to measure them, including the state of the art of their ...
Alessio D'Errico, Ebrahim Karimi
wiley +1 more source
From spinning primaries to permutation orbifolds
We carry out a systematic study of primary operators in the conformal field theory of a free Weyl fermion. Using SO(4, 2) characters we develop counting formulas for primaries constructed using a fixed number of fermion fields.
Robert de Mello Koch +2 more
doaj +1 more source
Constructing Separable Arnold Snakes of Morse Polynomials
We give a new and constructive proof of the existence of a special class of univariate polynomials whose graphs have preassigned shapes. By definition, all the critical points of a Morse polynomial function are real and distinct and all its critical ...
Sorea, Miruna-Stefana
core +1 more source
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 +3 more
openaire +3 more sources
Linearized polynomials and permutation polynomials of finite fields.
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. +2 more
openaire +3 more sources
MagPiezo enables wireless activation of endogenous Piezo1 channels without genetic modification using 19 nm magnetic nanoparticles and low‐intensity magnetic fields. It generates torque forces at the piconewton scale to trigger mechanotransduction in endothelial cells, standing as a novel platform to interrogate and manipulate Piezo1 activity in vitro.
Susel Del Sol‐Fernández +7 more
wiley +1 more source
Parabolic Catalan numbers count flagged Schur functions and their appearances as type A Demazure characters (key polynomials) [PDF]
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
2-stack pushall sortable permutations [PDF]
In the 60's, Knuth introduced stack-sorting and serial compositions of stacks. In particular, one significant question arise out of the work of Knuth: how to decide efficiently if a given permutation is sortable with 2 stacks in series?
Pierrot, Adeline, Rossin, Dominique
core +1 more source

