English
Related papers

Related papers: Ideal Decomposition of Hyperplane Arrangements

200 papers

In 1960 Schwinger [J. Schwinger, Proc.Natl.Acad.Sci. 46 (1960) 570- 579] proposed the algorithm for factorization of unitary operators in the finite M dimensional Hilbert space according to a coprime decomposition of M. Using a special…

Quantum Physics · Physics 2010-02-09 B Simkhovich , A Mann , J Zak

For a central, not necessarily reduced, hyperplane arrangement $f$ equipped with any factorization $f = f_{1} \cdots f_{r}$ and for $f^{\prime}$ dividing $f$, we consider a more general type of Bernstein--Sato ideal consisting of the…

Algebraic Geometry · Mathematics 2020-06-30 Daniel Bath

We extend the Shi bijection from the Borel subalgebra case to parabolic subalgebras. In the process, the $I$-deleted Shi arrangement $\texttt{Shi}(I)$ naturally emerges. This arrangement interpolates between the Coxeter arrangement…

Combinatorics · Mathematics 2013-09-11 Chao-Ping Dong

The Grassmannian, which is the manifold of all $k$-dimensional subspaces in the Euclidean space $\mathbb{R}^n$, was decomposed through three equivalent methods connecting combinatorial geometries, Schubert cells and convex polyhedra by…

Combinatorics · Mathematics 2025-06-11 Houshan Fu , Weikang Liang , Suijie Wang

Let $\mathcal{A}$ denote a central hyperplane arrangement of rank $n$ in affine space $\mathbb{K}^n$ over an infinite field $\mathbb{K}$ and let $l_1,\ldots, l_m\in R:= \mathbb K[x_1,\ldots,x_n]$ denote the linear forms defining the…

Commutative Algebra · Mathematics 2021-01-11 Ricardo Burity , Aron Simis , Stefan Tohaneanu

In "Faces of a Hyperplane Arrangement Enumerated by Ideal Dimension, with Applications to Plane, Plaids, and Shi," Zaslavsky showed how to compute the number $r_\ell(\mathcal{A})$ of regions of a real hyperplane arrangement $\mathcal{A}$…

Combinatorics · Mathematics 2026-05-21 Finn Southerland , Lani Southern , Su Zhou

Building on coprincipal mesoprimary decomposition [Kahle and Miller, 2014], we combinatorially construct an irreducible decomposition of any given binomial ideal. In a parallel manner, for congruences in commutative monoids we construct…

Commutative Algebra · Mathematics 2019-02-20 Thomas Kahle , Ezra Miller , Christopher O'Neill

We study partial fraction decompositions (PFDs) in several variables using tools from commutative algebra. We give criteria for when a rational function with poles on a hyperplane arrangement has a desirable PFD. Our criteria are obtained…

Commutative Algebra · Mathematics 2026-03-25 Claire de Korte , Teresa Yu

Questions that seek to determine whether a hyperplane arrangement property, be it geometric, arithmetic or topological, is of a combinatorial nature (that is determined by the intersection lattice) are abundant in the literature. To tackle…

Algebraic Geometry · Mathematics 2021-11-02 Benoît Guerville-Ballé

This article investigates atomic decompositions in geometric lattices isomorphic to the partition lattice $\Pi(X)$ of a finite set $X$, a fundamental structure in lattice theory and combinatorics. We explore the role of atomicity in these…

Combinatorics · Mathematics 2025-06-19 Alex Aguila , Elvis Cabrera , Jyrko Correa-Morris

We introduce and study a notion of decomposition of planar point sets (or rather of their chirotopes) as trees decorated by smaller chirotopes. This decomposition is based on the concept of mutually avoiding sets (which we rephrase as…

Computational Geometry · Computer Science 2024-06-12 Mathilde Bouvel , Valentin Féray , Xavier Goaoc , Florent Koechlin

We investigate the Galois module structure of the Tate-Shafarevich group of elliptic curves. For a Dirichlet character $\chi$, we give an explicit conjecture relating the ideal factorization of $L(E,\chi,1)$ to the Galois module structure…

Number Theory · Mathematics 2025-01-17 Céline Maistret , Himanshu Shukla

The intersection data of a hyperplane arrangement is described by a geometric lattice, or equivalently a simple matroid. There is a rich interplay between this combinatorial structure and the topology of the arrangement complement. In this…

Combinatorics · Mathematics 2025-04-22 Christin Bibby

We define a combinatorial object that can be associated with any conic-line arrangement with ordinary singularities, which we call the combinatorial Poincar\'e polynomial. We prove a Terao-type factorization statement on the splitting of…

Algebraic Geometry · Mathematics 2025-08-19 Piotr Pokora

For a cellular algebra $\A$ with a cellular basis $\ZC$, we consider a decomposition of the unit element $1_\A$ into orthogonal idempotents (not necessary primitive) satisfying some conditions. By using this decomposition, the cellular…

Representation Theory · Mathematics 2008-05-09 Kentaro Wada

A frame in an $n$-dimensional Hilbert space $H_n$ is a possibly redundant collection of vectors $\{f_i\}_{i\in I}$ that span the space. A tight frame is a generalization of an orthonormal basis. A frame $\{f_i\}_{i\in I}$ is said to be…

Functional Analysis · Mathematics 2015-11-10 Alice Z. -Y. Chan , Martin S. Copenhaver , Sivaram K. Narayan , Logan Stokols , Allison Theobold

We investigate the structure of ideals generated by binomials (polynomials with at most two terms) and the schemes and varieties associated to them. The class of binomial ideals contains many classical examples from algebraic geometry, and…

alg-geom · Mathematics 2008-02-03 David Eisenbud , Bernd Sturmfels

We study in this paper some property of Lipschitz mappings which admit factorization through an operator ideal. We try to construct Lipschitz cross-norms from known tensor norms in order to represent certain classes of Lipschitz mappings.…

Functional Analysis · Mathematics 2017-10-18 Khalil Saadi

Kamiya, Takemura, and Terao introduced a characteristic quasi-polynomial which enumerates the numbers of elements in the complement of hyperplane arrangements modulo positive integers. In this paper, we compute the characteristic…

Combinatorics · Mathematics 2026-03-03 Yusuke Mori , Norihiro Nakashima

We present an effective method for computing parametric primary decomposition via comprehensive Gr\"obner systems. In general, it is very difficult to compute a parametric primary decomposition of a given ideal in the polynomial ring with…

Symbolic Computation · Computer Science 2024-08-29 Yuki Ishihara , Kazuhiro Yokoyama