English
Related papers

Related papers: Broken circuit complexes and hyperplane arrangemen…

200 papers

We introduce a class of graphs with coloured edges to encode subsystems of the classical root systems, which in particular classify them up to equivalence. We further use the graphs to describe root-kernel intersections, as well as…

Rings and Algebras · Mathematics 2024-05-21 Gabriele Rembado

Perturbed graphic matroids are binary matroids that can be obtained from a graphic matroid by adding a noise of small rank. More precisely, r-rank perturbed graphic matroid M is a binary matroid that can be represented in the form I +P,…

Data Structures and Algorithms · Computer Science 2019-02-20 Fedor V. Fomin , Petr A. Golovach , Daniel Lokshtanov , Saket Saurabh , Meirav Zehavi

We classify modules and rings with some specific properties of their intersection graphs. In particular, we describe rings with infinite intersection graphs containing maximal left ideals of finite degree. This answers a question raised in…

Rings and Algebras · Mathematics 2017-07-26 Jerzy Matczuk , Marta Nowakowska , Edmund R. Puczyłowski

In this paper we study the family of planar hybrid differential systems formed by two linear centers and a polynomial reset map of any degree. We study their limit cycles and also provide examples of these hybrid systems exhibiting chaotic…

Dynamical Systems · Mathematics 2024-10-11 Jaume Llibre , Paulo Santana

A set partition is $c$-uniform if every block has size $c$. Two families of $c$-uniform partitions of a finite set are said to be cross $t$-intersecting if two partitions from different families share at least $t$ blocks. In this paper, we…

Combinatorics · Mathematics 2025-09-30 Tian Yao , Mengyu Cao , Haixiang Zhang

We prove that every infinite sequence of skew-symmetric or symmetric matrices M_1, M_2, ... over a fixed finite field must have a pair M_i, M_j (i<j) such that M_i is isomorphic to a principal submatrix of the Schur complement of a…

Combinatorics · Mathematics 2014-03-26 Sang-il Oum

We study the set of monomial ideals in a polynomial ring as an ordered set, with the ordering given by reverse inclusion. We give a short proof of the fact that every antichain of monomial ideals is finite. Then we investigate ordinal…

Logic · Mathematics 2007-05-23 Matthias Aschenbrenner , Wai-Yan Pong

Quantitative estimates related to the classical Borsuk problem of splitting set in Euclidean space into subsets of smaller diameter are considered. For a given $k$ there is a minimal diameter of subsets at which there exists a covering with…

Metric Geometry · Mathematics 2022-10-25 Alexander Tolmachev , Dmitry Protasov , Vsevolod Voronov

We propose a model for the calculation of renormalized charges and osmotic properties of mixtures of highly charged colloidal particles. The model is a generalization of the cell model and the notion of charge renormalization as introduced…

Soft Condensed Matter · Physics 2009-03-19 Aldemar Torres , Gabriel Tellez , Rene van Roij

Superintegrable systems are a class of physical systems which possess more conserved quantities than their degrees of freedom. The study of these systems has a long history and continues to attract significant international attention. This…

Mathematical Physics · Physics 2018-02-26 Md Fazlul Hoque

We describe a method for solving linear systems over the localization of a commutative ring $R$ at a multiplicatively closed subset $S$ that works under the following hypotheses: the ring $R$ is coherent, i.e., we can compute finite…

Commutative Algebra · Mathematics 2018-06-21 Sebastian Posur

We investigate decompositions of Betti diagrams over a polynomial ring within the framework of Boij-S\"oderberg theory. That is, given a Betti diagram, we determine if it is possible to decompose it into the Betti diagrams of complete…

Commutative Algebra · Mathematics 2017-04-20 Michael T. Annunziata , Courtney R. Gibbons , Cole Hawkins , Alexander J. Sutherland

Oriented matroids (often called order types) are combinatorial structures that generalize point configurations, vector configurations, hyperplane arrangements, polyhedra, linear programs, and directed graphs. Oriented matroids have played a…

Combinatorics · Mathematics 2020-06-17 Ilan Adler , Jesús A. De Loera , Steven Klee , Zhenyang Zhang

Given an $\Bbb{F}$-represented matroid $(M,\rho)$ with the ground set $[m]$, the representation $\rho$ naturally defines a hyperplane arrangement $\mathcal{A}_\rho$. We will study its parallel translates $\mathcal{A}_{\rho,{g}}$ of…

Combinatorics · Mathematics 2020-10-15 Beifang Chen , Houshan Fu , Suijie Wang

Matroids, particularly linear ones, have been a powerful tool in parameterized complexity for algorithms and kernelization. They have sped up or replaced dynamic programming. Delta-matroids generalize matroids by encapsulating structures…

Data Structures and Algorithms · Computer Science 2025-02-20 Eduard Eiben , Tomohiro Koana , Magnus Wahlström

We initiate the study of matroid problems in a new oracle model called dynamic oracle. Our algorithms in this model lead to new bounds for some classic problems, and a "unified" algorithm whose performance matches previous results developed…

Data Structures and Algorithms · Computer Science 2023-04-28 Joakim Blikstad , Sagnik Mukhopadhyay , Danupon Nanongkai , Ta-Wei Tu

We prove lower bounds of order $n\log n$ for both the problem to multiply polynomials of degree $n$, and to divide polynomials with remainder, in the model of bounded coefficient arithmetic circuits over the complex numbers. These lower…

Computational Complexity · Computer Science 2007-05-23 Peter Buergisser , Martin Lotz

In this article we associate to every lattice ideal $I_{L,\rho}\subset K[x_1,..., x_m]$ a cone $\sigma $ and a graph $G_{\sigma}$ with vertices the minimal generators of the Stanley-Reisner ideal of $\sigma $. To every polynomial $F$ we…

Commutative Algebra · Mathematics 2007-05-23 Anargyros Katsabekis , Marcel Morales , Apostolos Thoma

In this paper, we study ideals spanned by polynomials or overconvergent series in a Tate algebra. With state-of-the-art algorithms for computing Tate Gr{\"o}bner bases, even if the input is polynomials, the size of the output grows with the…

Symbolic Computation · Computer Science 2022-02-16 Xavier Caruso , Tristan Vaccon , Thibaut Verron

This dissertation describes the space of heteroclinic orbits for a class of semilinear parabolic equations, focusing primarily on the case where the nonlinearity is a second degree polynomial with variable coefficients. Along the way, a new…

Analysis of PDEs · Mathematics 2008-05-01 Michael Robinson