Related papers: Permutations with only reduced co-BPDs
We study the computational complexity of decomposing finite discrete dynamical systems (FDDSs) in terms of the semiring operations of alternative and synchronous execution, which is useful for the analysis of discrete phenomena in science…
Motivated by the Poisson Dixmier-Moeglin equivalence problem, a systematic study of commutative unitary rings equipped with a {\em biderivation}, namely a binary operation that is a derivation in each argument, is here begun, with an eye…
We consider linear error correcting codes associated to higher dimensional projective varieties defined over a finite field. The problem of determining the basic parameters of such codes often leads to some interesting and difficult…
We give a non-commutative Positivstellensatz for CP^n: The (commutative) *-algebra of polynomials on the real algebraic set CP^n with the pointwise product can be realized by phase space reduction as the U(1)-invariant polynomials on…
Many high-dimensional uncertainty quantification problems are solved by polynomial dimensional decomposition (PDD), which represents Fourier-like series expansion in terms of random orthonormal polynomials with increasing dimensions. This…
Using techniques from Poisson approximation, we prove explicit error bounds on the number of permutations that avoid any pattern. Most generally, we bound the total variation distance between the joint distribution of pattern occurrences…
Recently, Lembert, Gilson et al proposed a lucid and systematic approach to obtain bilinear B\"{a}cklund transformations and Lax pairs for constant-coefficient soliton equations based on the use of binary Bell polynomials. In this paper, we…
We study three fundamental three-dimensional (3D) geometric packing problems: 3D (Geometric) Bin Packing (3D-BP), 3D Strip Packing (3D-SP), and Minimum Volume Bounding Box (3D-MVBB), where given a set of 3D (rectangular) cuboids, the goal…
We define the bidirectional distance profile (BDP) of a convolutional code as the minimum of the distance profiles of the code and its corresponding "reverse" code. We present tables of codes with the optimum BDP (OBDP), which minimize the…
We suggest an upper bound on binomial coefficients that holds over the entire parameter range and whose form repeats the form of the de Moivre-Laplace approximation of the symmetric binomial distribution. Using the bound, we estimate the…
Consider a finite collection of affine hyperplanes in $\mathbb R^d$. The hyperplanes dissect $\mathbb R^d$ into finitely many polyhedral chambers. For a point $x\in \mathbb R^d$ and a chamber $P$ the metric projection of $x$ onto $P$ is the…
The pseudomode method for open quantum systems, also known as the mesoscopic leads approach, consists in replacing a structured environment by a set of auxiliary "pseudomodes" subject to local damping that approximate the environment's…
For the combined field-theoretic system of the four (3 + 1)-dimensional (4D) Abelian 3-form and 1-form gauge theories, we show the existence of a unique bosonic symmetry transformation that is constructed from the four infinitesimal,…
Schubert polynomials for the classical groups were defined by S.Billey and M.Haiman in 1995; they are polynomial representatives of Schubert classes in a full flag variety of a classical group. We provide a combinatorial description for…
The vacuum structure and spectra of two-dimensional gauge theories with N=(2,2) supersymmetry are investigated. These theories admit a twisted mass term for charged chiral matter multiplets. In the case of a U(1) gauge theory with N chiral…
We give the first approximation algorithm for mixed packing and covering semidefinite programs (SDPs) with polylogarithmic dependence on width. Mixed packing and covering SDPs constitute a fundamental algorithmic primitive with recent…
In this undergraduate thesis, we expand on the study of statistics on restricted growth functions avoiding patterns initiated by Campbell, et. al. Restricted growth functions are of interest because they are in bijection with set…
We study random uniform permutations in an important class of pattern-avoiding permutations: the separable permutations. We describe the asymptotics of the number of occurrences of any fixed given pattern in such a random permutation in…
Bicommutative algebras are nonassociative algebras satisfying the polynomial identities of right- and left-commutativity (xy)z=(xz)y and x(yz)=y(xz). We study subvarieties of the variety of all bicommutative algebras over a field of…
We study orbifolds by permutations of two identical N=2 minimal models within the Gepner construction of four dimensional heterotic strings. This is done using the new N=2 supersymmetric permutation orbifold building blocks we have recently…