English
Related papers

Related papers: Star configurations on generic hypersurfaces

200 papers

A star of length $ \ell $ is defined as the complete bipartite graph $ K_{1,\ell } $. In this paper we deal with the problem of edge decomposition of graphs into stars of varying lengths. Given a graph $ G $ and a list of integers…

Computational Complexity · Computer Science 2025-06-10 Sahab Hajebi , Ramin Javadi

We introduce a new algorithm computing the characteristic polynomials of hyperplane arrangements which exploits their underlying symmetry groups. Our algorithm counts the chambers of an arrangement as a byproduct of computing its…

Combinatorics · Mathematics 2025-05-21 Taylor Brysiewicz , Holger Eble , Lukas Kühne

Consider the conjugation action of the general linear group $\operatorname{GL}_{2}(K)$ on the polynomial ring $K[X_{2 \times 2}]$. When $K$ is an infinite field, the ring of invariants is a polynomial ring generated by the trace and the…

Commutative Algebra · Mathematics 2025-04-04 Aryaman Maithani

Let $\mathbb F$ be a field and $P \in \mathbb F [x_1,\ldots, x_n]$ be a homogeneous polynomial such that $|\mathbb F| > \deg(P)$ and $\phi, \psi\colon \mathbb F^n \to \mathbb F^n$ be two maps such that $P(\mathbf{x} + \lambda\mathbf{y}) =…

Combinatorics · Mathematics 2026-04-28 Andrey Yurkov

The computation of the sparse principal component of a matrix is equivalent to the identification of its principal submatrix with the largest maximum eigenvalue. Finding this optimal submatrix is what renders the problem…

Information Theory · Computer Science 2013-12-23 Megasthenis Asteris , Dimitris S. Papailiopoulos , George N. Karystinos

We study the problem of when a periodic square matrix of order $n$ over an arbitrary field $\mathbb{F}$ is decomposable into the sum of a square-zero matrix and a torsion matrix, and show that this decomposition can always be obtained for…

Rings and Algebras · Mathematics 2026-04-20 Peter Danchev , Esther García , Miguel Gómez Lozano

We describe an algorithm computing the monodromy and the pole order filtration on the top Milnor fiber cohomology of hypersurfaces in $\mathbb{P}^n$ whose pole order spectral sequence degenerates at the second page. In the case of…

Algebraic Geometry · Mathematics 2017-10-05 Alexandru Dimca , Gabriel Sticlaru

Let $\mathcal A$ be an $\mathbb F$-algebra and $\omega \in \mathcal A\langle x_1, \ldots, x_m \rangle$ which defines a map $\mathcal A^m \rightarrow \mathcal A$ by evaluation, called a polynomial map with constant. We consider $\mathcal {A}…

Rings and Algebras · Mathematics 2026-05-01 Prachi Saini , Anupam Singh

Let $F$ be a family of pseudo-disks in the plane, and $P$ be a finite subset of $F$. Consider the hypergraph $H(P,F)$ whose vertices are the pseudo-disks in $P$ and the edges are all subsets of $P$ of the form $\{D \in P \mid D \cap S \neq…

Computational Geometry · Computer Science 2018-02-27 Boris Aronov , Anirudh Donakonda , Esther Ezra , Rom Pinchasi

An elegant procedure which characterizes a decomposition of some class of binomial configurations into two other, resembling a definition of Pascal's Triangle, was given in \cite{gevay}. In essence, this construction was already presented…

Combinatorics · Mathematics 2019-07-23 Krzysztof Prażmowski

Consider a polynomial $F$ in $m$ variables and a finite point ensemble $S=S_1 \times ... \times S_m$. When given the leading monomial of $F$ with respect to a lexicographic ordering we derive improved information on the possible number of…

Information Theory · Computer Science 2011-01-27 Olav Geil , Casper Thomsen

This paper studies the notions of star and semistar operations over a polynomial ring. It aims at characterizing when every upper to zero in $R[X]$ is a $*$-maximal ideal and when a $*$-maximal ideal $Q$ of $R[X]$ is extended from $R$, that…

Commutative Algebra · Mathematics 2007-11-15 Abdeslam Mimouni

We will start from the beginning and define a matroid and its Orlik-Solomon algebra and holonomy Lie algebra, but first we give some background from topology and cohomology. A (central) hyperplane arrangement is a finite number of subspaces…

Combinatorics · Mathematics 2020-12-23 Clas Löfwall

In this article we extend the notion of determinantal representation of hypersurfaces to the determinantal representation of sections of the determinant line bundle of a vector bundle. We give several examples, and prove some necessary…

Algebraic Geometry · Mathematics 2026-02-19 A. El Mazouni , D. S. Nagaraj , Supravat Sarkar

Let $\K$ be a field of characteristic zero and $\Kbar$ be an algebraic closure of $\K$. Consider a sequence of polynomials$G=(g\_1,\dots,g\_s)$ in $\K[X\_1,\dots,X\_n]$, a polynomial matrix $\F=[f\_{i,j}] \in \K[X\_1,\dots,X\_n]^{p \times…

Symbolic Computation · Computer Science 2018-03-01 Jonathan D. Hauenstein , Mohab Safey El Din , Éric Schost , Thi Xuan Vu

We construct, for every even dimensional sphere $S^n$, $n >1$, and every odd integer $k$, a homogeneous polynomial map $f: S^{n}\to S^{n}$ of Brouwer degree $k$ and algebraic degree $2|k|-1$.

Algebraic Topology · Mathematics 2007-05-23 Javier Turiel

Consider a finite collection of affine hyperplanes in $\mathbb R^d$. The hyperplanes dissect $\mathbb R^d$ into finitely many polyhedral chambers. For a point $x\in \mathbb R^d$ and a chamber $P$ the metric projection of $x$ onto $P$ is the…

Metric Geometry · Mathematics 2020-09-02 Zakhar Kabluchko

The geometric picture of the star-product based on its Fourier representation kernel is utilized in the evaluation of chains of star-products and the intuitive appreciation of their associativity and symmetries. Such constructions appear…

High Energy Physics - Theory · Physics 2009-10-02 Cosmas Zachos

We study universal polynomials of characteristic classes associated to the $\mathcal{A}$-classification (i.e. up to right-left equivalence) of holomorphic map-germs $(\mathbb{C}^2,0) \to (\mathbb{C}^n, 0)$ $(n=2,3)$. That enables us to…

Algebraic Geometry · Mathematics 2021-08-20 Takahisa Sasajima , Toru Ohmoto

The tensor rank decomposition, also known as canonical polyadic(CP) or simply tensor decomposition, has a long history in multilinear algebra. However, computing a rank decomposition becomes particularly challenging when the rank lies…

Optimization and Control · Mathematics 2025-11-11 Zequn Zheng , Hongchao Zhang , Guangming Zhou
‹ Prev 1 3 4 5 6 7 10 Next ›