Related papers: A family of reductions for Schubert intersection p…
In this paper, we consider a reduction of a new system of partial difference equations, which was obtained in our previous paper (Joshi and Nakazono, arXiv:1906.06650) and shown to be consistent around a cuboctahedron. We show that this…
A square trisection is a problem of assembling three identical squares from a larger square, using a minimal number of pieces. This paper presents an historical overview of the square trisection problem starting with its origins in the…
This paper is concerned with the study of a model case of first order Hamilton-Jacobi equations posed on a "junction", that is to say the union of a finite number of half-lines with a unique common point. The main result is a comparison…
A Newton-Okounkov polytope of a complete flag variety can be turned into a convex geometric model for Schubert calculus. Namely, we can represent Schubert cycles by linear combinations of faces of the polytope so that the intersection…
A large literature specifies conditions under which the information complexity for a sequence of numerical problems defined for dimensions $1, 2, \ldots$ grows at a moderate rate, i.e., the sequence of problems is tractable. Here, we focus…
In a first part, we give a method for solving a family of fuchsian systems of operators of pseudo-derivations associated to a family of homographies with two parameters which unify and generalize the differential, the difference and the…
A bijection is defined from Littlewood-Richardson tableaux to rigged configurations. It is shown that this map preserves the appropriate statistics, thereby proving a quasi-particle expression for the generalized Kostka polynomials, which…
In this paper we give a novel solution to a classical completion problem for square matrices. This problem was studied by many authors through time, and it is completely solved in [2, 3]. In this paper we relate this classical problem to a…
We generalize the reduction mechanism for linear programming problems and semidefinite programming problems from [arXiv:1410.8816] in two ways 1) relaxing the requirement of affineness and 2) extending to fractional optimization problems.…
We give restriction formula for stable basis of the Springer resolution, and generalize it to cotangent bundles of homogeneous spaces. By a limiting process, we get the restriction formula of Schubert varieties.
Hilbert's 15th problem called for a rigorous foundation of Schubert's calculus, in which a long standing and challenging part is Schubert's problem of characteristics. In the course of securing the foundation of algebraic geometry, Van der…
In paper I of this series we gave positive formulae for expanding the product $\mathfrak S^\pi \mathfrak S^\rho$ of two Schubert polynomials, in the case that both $\pi,\rho$ had shared descent set of size $\leq 3$. Here we introduce and…
We provide direct proofs of product and coproduct formulae for Schur functions where the coefficients (Littlewood--Richardson coefficients) are defined as counting puzzles. The product formula includes a second alphabet for the Schur…
The paper develops elementary linear algebra methods to compute the determinants of the tensor symmetrizations of quadratic and hermitian forms over fields of good characteristic. Explicit results are given for the partitions $(n)$,…
Reduction algebras (also known as generalized Mickelsson algebras, Zhelobenko algebras, or transvector algebras) are well-studied associative algebras appearing in the representation theory of Lie algebras. In the 1990s, Zhelobenko noted…
Let $X$ be a smooth $n\,$-dimensional manifold and $D$ be an open connected set in $X$ with smooth boundary $\partial D$. Perturbing the Cauchy problem for an elliptic system $Au = f$ in $D$ with data on a closed set $\iG \subset \partial…
Computing the diameter of the intersection graphs of objects is a basic problem in computational geometry. Previous works showed that the complexity of computing the diameter mainly depends on the object types: for unit disks and squares in…
A Littlewood polynomial is a single-variable polynomial all of whose coefficients lie in $\{ \pm 1\}$. We establish the leading term asymptotics of the number of reciprocal or skew-reciprocal Littlewood polynomials with square discriminant.…
We study the solubility of cubic equations over the integers. Assuming a necessary congruence condition, the existence of such solutions is established when the $h$-invariant of $C$ is at least $14$, improving on work of Davenport-Lewis and…
This paper introduces a family of valid inequalities, that we term consistency cuts, to be applied to a Dantzig-Wolfe reformulation (or decomposition) with linking variables. We prove that these cuts ensure an integer solution to the…