Related papers: Constructing maximal pipedreams of double Grothend…
We consider a large-scale matrix multiplication problem where the computation is carried out using a distributed system with a master node and multiple worker nodes, where each worker can store parts of the input matrices. We propose a…
A binary $[98280, 24, 47104]_2$ projective two-weight code related to the sporadic simple group ${\rm Co}_1$ of Conway is constructed as a faithful and absolutely irreducible submodule of the permutation module induced by the primitive…
We show that the principal specialization of the Schubert polynomial at $w$ is bounded below by $1+p_{132}(w)+p_{1432}(w)$ where $p_u(w)$ is the number of occurrences of the pattern $u$ in $w$, strengthening a previous result by A.…
In 2011, Rubey generalized chute and ladder moves on the set of reduced pipe dreams for a permutation $w$ and conjectured that the induced poset on reduced pipe dreams is a lattice. In this paper, we prove this conjecture. Our key tool is a…
We present a combination of two algorithms that accurately calculate multiple roots of general polynomials. Algorithm I transforms the singular root-finding into a regular nonlinear least squares problem on a pejorative manifold, and…
We show that maximal 0-1-fillings of moon polynomials with restricted chain lengths can be identified with certain rc-graphs, also known as pipe dreams. In particular, this exhibits a connection between maximal 0-1-fillings of Ferrers…
Branched covers of the complex projective line ramified over $0,1$ and $\infty$ (Grothendieck's {\em dessins d'enfant}) of fixed genus and degree are effectively enumerated. More precisely, branched covers of a given ramification profile…
We study a family of dissections of flow polytopes arising from the subdivision algebra. To each dissection of a flow polytope, we associate a polynomial, called the left-degree polynomial, which we show is invariant of the dissection…
Motivated by polymer-based data-storage platforms that use chains of binary synthetic polymers as the recording media and read the content via tandem mass spectrometers, we propose a new family of codes that allows for unique string…
A classical theorem of Wendroff shows that one may reconstructs a sequence of orthogonal polynomials on the real line from two non-constant polynomials of consecutive degrees whose zeros strictly interlace on the real line. In this note we…
We construct double Grothendieck polynomials of classical types which are essentially equivalent to but simpler than the polynomials defined by A.N.Kirillov in arXiv:1504.01469 and identify them with the polynomials defined by T.Ikeda and…
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…
Kazhdan-Lusztig ideals, a family of generalized determinantal ideals investigated in [Woo-Yong '08], provide an explicit choice of coordinates and equations encoding a neighbourhood of a torus-fixed point of a Schubert variety on a type A…
The coefficients of the chain polynomial of a finite poset enumerate chains in the poset by their number of elements. It has been a challenging open problem to determine which posets have real-rooted chain polynomials. Two new classes of…
We derive explicit formulae for the generating series of mixed Grothendieck dessins d'enfant/monotone/simple Hurwitz numbers, via the semi-infinite wedge formalism. This reveals the strong piecewise polynomiality in the sense of…
We introduce a unified framework for computing approximately-optimal preconditioners for solving linear and non-linear systems of equations. We demonstrate that the condition number minimization problem, under structured transformations…
Residue number systems based on pairwise relatively prime moduli are a powerful tool for accelerating integer computations via the Chinese Remainder Theorem. We study a structured family of moduli of the form $2^n - 2^k + 1$, originally…
We present a new upper bound for the orders of derivatives in the Rosenfeld-Groebner algorithm. This algorithm computes a regular decomposition of a radical differential ideal in the ring of differential polynomials over a differential…
Double polycirculant codes are introduced here as a generalization of double circulant codes. When the matrix of the polyshift is a companion matrix of a trinomial, we show that such a code is isodual, hence formally self-dual. Numerical…
Determining the weight distribution of a linear code is a classical and fundamental topic in coding theory that has been extensively investigated. Repeated-root cyclic codes, which form a significant subclass of error-correcting codes, have…