English
Related papers

Related papers: Constructing maximal pipedreams of double Grothend…

200 papers

Let $q$ be a power of a prime, let $\mathbb{F}_q$ be the finite field with $q$ elements and let $n \geq 2$. For a polynomial $h(x) \in \mathbb{F}_q[x]$ of degree $n \in \mathbb{N}$ and a subset $W \subseteq [0,n] := \{0, 1, \ldots, n\}$, we…

Number Theory · Mathematics 2016-05-03 Aleksandr Tuxanidy , Qiang Wang

We study some essential arithmetic properties of a new tree-based number representation, {\em hereditarily binary numbers}, defined by applying recursively run-length encoding of bijective base-2 digits. Our representation expresses giant…

Data Structures and Algorithms · Computer Science 2013-06-06 Paul Tarau

Let $D$ be a division algebra, finite-dimensional over its center, and $R=D[t;\sigma,\delta]$ a skew polynomial ring. Using skew polynomials $f\in R$, we construct division algebras and a generalization of maximum rank distance codes…

Rings and Algebras · Mathematics 2023-03-02 Daniel Thompson , Susanne Pumpluen

We study a sequence of polynomials orthogonal with respect to a one parameter family of weights $$ w(x):=w(x,t)=\rex^{-t/x}\:x^{\al}(1-x)^{\bt},\quad t\geq 0, $$ defined for $x\in[0,1].$ If $t=0,$ this reduces to a shifted Jacobi weight.…

Classical Analysis and ODEs · Mathematics 2010-08-03 Yang Chen , Dan Dai

We show that decoding of $\ell$-Interleaved Gabidulin codes, as well as list-$\ell$ decoding of Mahdavifar--Vardy codes can be performed by row reducing skew polynomial matrices. Inspired by row reduction of $\F[x]$ matrices, we develop a…

Information Theory · Computer Science 2016-07-15 Sven Puchinger , Johan Rosenkilde né Nielsen , Wenhui Li , Vladimir Sidorenko

Asymptotically good sequences of ramp secret sharing schemes were given in [Asymptotically good ramp secret sharing schemes, arXiv:1502.05507] by using one-point algebraic geometric codes defined from asymptotically good towers of function…

Information Theory · Computer Science 2015-11-20 Olav Geil , Stefano Martin , Umberto Martínez-Peñas , Diego Ruano

Grothendieck polynomials $\mathfrak{G}_w$ of permutations $w\in S_n$ were introduced by Lascoux and Sch\"utzenberger in 1982 as a set of distinguished representatives for the K-theoretic classes of Schubert cycles in the K-theory of the…

Combinatorics · Mathematics 2022-01-25 Karola Mészáros , Linus Setiabrata , Avery St. Dizier

We are interested in computing the Bredon cohomology with coefficients in the constant Mackey functor $\underline{ \mathbb{F}_2}$ for equivariant $\text{Rep}(C_2)$ spaces, in particular for Grassmannian manifolds of the form…

Algebraic Topology · Mathematics 2025-03-14 Eric Hogle

We present a method to obtain infinitely many examples of pairs $(W,D)$ consisting of a matrix weight $W$ in one variable and a symmetric second-order differential operator $D$. The method is based on a uniform construction of matrix valued…

Representation Theory · Mathematics 2014-12-23 Maarten van Pruijssen , Pablo Román

Based on unique decoding of the polynomial residue code with non-pairwise coprime moduli, a polynomial with degree less than that of the least common multiple (lcm) of all the moduli can be accurately reconstructed when the number of…

Information Theory · Computer Science 2017-03-24 Li Xiao , Xiang-Gen Xia

Permutation rational functions over finite fields have attracted high interest in recent years. However, only a few of them have been exhibited. This article studies a class of permutation rational functions constructed using trace maps on…

Number Theory · Mathematics 2024-01-01 Ruikai Chen , Sihem Mesnager

In this paper we introduce refined canonical stable Grothendieck polynomials and their duals with two infinite sequences of parameters. These polynomials unify several generalizations of Grothendieck polynomials including canonical stable…

Combinatorics · Mathematics 2024-04-04 Byung-Hak Hwang , Jihyeug Jang , Jang Soo Kim , Minho Song , U-Keun Song

We consider the class of polynomial optimization problems $\inf \{f(x):x\in K\}$ for which the quadratic module generated by the polynomials that define $K$ and the polynomial $c-f$ (for some scalar $c$) is Archimedean. For such problems,…

Optimization and Control · Mathematics 2013-07-05 Vaithilingam Jeyakumar , Jean-Bernard Lasserre , G. Li

Motivated by the Novikov equation and its peakon problem, we propose a new mixed type Hermite--Pad\'{e} approximation whose unique solution is a sequence of polynomials constructed with the help of Pfaffians. These polynomials belong to the…

Exactly Solvable and Integrable Systems · Physics 2022-03-09 Xiang-Ke Chang

We describe a combinatorial approach for investigating properties of rational numbers. The overall approach rests on structural bijections between rational numbers and familiar combinatorial objects, namely rooted trees. We emphasize that…

Combinatorics · Mathematics 2012-01-13 Edinah K. Gnang , Chetan Tonde

In arXiv:math/0405373 , Eisenbud, Huneke and Ulrich conjectured a result on the Castelnuovo-Mumford regularity of the embedding of a projective space $\mathbb{P}^{n-1}\hookrightarrow \mathbb{P}^{r-1}$ determined by generators of a linearly…

Commutative Algebra · Mathematics 2020-12-11 Marc Chardin , Navid Nemati

Involution Schubert polynomials represent cohomology classes of $K$-orbit closures in the complete flag variety, where $K$ is the orthogonal or symplectic group. We show they also represent $T$-equivariant cohomology classes of subvarieties…

Combinatorics · Mathematics 2022-11-09 Zachary Hamaker , Eric Marberg , Brendan Pawlowski

We adapt the arguments of Marcus, Spielman and Srivastava in their proof of the Kadison-Singer problem to prove improved paving estimates. Working with Anderson's paving formulation of Kadison-Singer instead of Weaver's vector balancing…

Functional Analysis · Mathematics 2018-11-05 Jonathan Leake , Mohan Ravichandran

We introduce analogs of left and right RSK insertion for Schubert calculus of complete flag varieties. The objects being inserted are certain biwords, the insertion objects are bumpless pipe dreams, and the recording objects are decorated…

Combinatorics · Mathematics 2022-06-30 Daoji Huang , Pavlo Pylyavskyy

We propose and study a variant of pliable index coding (PICOD) where receivers have preferences for their unknown messages and give each unknown message a preference ranking. We call this the preferential pliable index-coding (PPICOD)…

Information Theory · Computer Science 2023-05-17 Daniel Byrne , Lawrence Ong , Parastoo Sadeghi , Badri N. Vellambi
‹ Prev 1 4 5 6 7 8 10 Next ›