Related papers: Generalizations of Sch\"{o}bi's Tetrahedral Dissec…

Let $\mathcal{H}$ be a Coxeter hyperplane arrangement in $n$-dimensional Euclidean space. Assume that the negative of the identity map belongs to the associated Coxeter group $W$. Furthermore assume that the arrangement is not of type…

Our main theorems provide a single geometric setting in which polynomial representatives for Schubert classes in the integral cohomology ring of the flag manifold are determined uniquely, and have positive coefficients for geometric…

A partition of degree $n$ is a decomposition $n=i_1+i_2+\dots+i_q$, where ${i_1,i_2,\dots,i_q}$ are positive integers called the parts of the partition. Let $\lambda>0$ be an integer. The partition is said to be a $\lambda$--partition if…

We adapt for algebraically closed fields $k$ of characteristic greater than $2$ two results of Voisin, on the decomposition of the diagonal of a smooth cubic hypersurface $X$ of dimension $3$ over $\mathbb C$, namely: the equivalence…

Let $n,m\in \mathbb{N}$, and let $B_{n,m}(\mathbb{R}P^2)$ be the set of $(n + m)$-braids of the projective plane whose associated permutation lies in the subgroup $S_n\times S_m$ of the symmetric group $S_{n+m}$. We study the splitting…

In this paper, we first consider the subpath convex hull query problem: Given a simple path $\pi$ of $n$ vertices, preprocess it so that the convex hull of any query subpath of $\pi$ can be quickly obtained. Previously, Guibas, Hershberger,…

Let R be a commutative ring, q a unit of R and P a multiplicatively antisymmetric matrix with coefficients which are integers powers of q. Denote by SE(q,P) the multiparameter quantum matrix bialgebra associated to q and P.Slightly…

More than 25 years ago Chazelle~\emph{et al.} (FOCS 1991) studied the following question: Is it possible to cut any set of $n$ lines in ${\Bbb R}^3$ into a subquadratic number of fragments such that the resulting fragments admit a depth…

The Feichtinger Conjecture, if true, would have as a corollary that for each set $E\subset \T$ and $\Lambda \subset \Z$, there is a partition $\Lambda_1,...,\Lambda_N$ of $\Z$ such that for each $1\le i \le N$, $\{\exp(2\pi i x\lambda):…

In this paper, we study the mathematical structure and numerical approximation of elliptic problems posed in a (3D) domain $\Omega$ when the right-hand side is a (1D) line source $\Lambda$. The analysis and approximation of such problems is…

We consider the problem of slicing a compact metric space \Omega with sets of the form \pi_{\lambda}^{-1}\{t\}, where the mappings \pi_{\lambda} \colon \Omega \to \R, \lambda \in \R, are \emph{generalized projections}, introduced by Yuval…

Given $n$ non-vertical lines in 3-space, their vertical depth (above/below) relation can contain cycles. We show that the lines can be cut into $O(n^{3/2}\mathop{\mathrm{polylog}} n)$ pieces, such that the depth relation among these pieces…

According to celebrated Hurwitz theorem, there exists four division algebras consisting of R (real numbers), C (complex numbers), H (quaternions) and O (octonions). Keeping in view the utility of octonion variable we have tried to extend…

We study the existence of a Chow-theoretic decomposition of the diagonal of a smooth cubic hypersurface, or equivalently, the universal triviality of its ${\rm CH}_0$-group. We prove that for odd dimensional cubic hypersurfaces or for cubic…

We consider the expansion of the square of a complete homogeneous function $h_\lambda$, or of an elementary symmetric function $e_\lambda$, in the basis of Schur functions. This square also decomposes into two plethysms, $s_2[h_\lambda]$…

We describe a recursive algorithm that decomposes an algebraic set into locally closed equidimensional sets, i.e. sets which each have irreducible components of the same dimension. At the core of this algorithm, we combine ideas from the…

We consider the complex cut polytope: the convex hull of Hermitian rank 1 matrices $xx^{\mathrm{H}}$, where the elements of $x \in \mathbb{C}^n$ are $m$th unit roots. These polytopes have applications in ${\text{MAX-3-CUT}}$, digital…

The cut polytope ${\rm CUT}(n)$ is the convex hull of the cut vectors in a complete graph with vertex set $\{1,\ldots,n\}$. It is well known in the area of combinatorial optimization and recently has also been studied in a direct relation…

Tverberg's theorem asserts that every (k-1)(d+1)+1 points in R^d can be partitioned into k parts, so that the convex hulls of the parts have a common intersection. Calder and Eckhoff asked whether there is a purely combinatorial deduction…

We describe an explicit geometric Littlewood-Richardson rule, interpreted as deforming the intersection of two Schubert varieties so that they break into Schubert varieties. There are no restrictions on the base field, and all…