Related papers: Broken circuit complexes and hyperplane arrangemen…
We report a class of {\it integrable} one-dimensional interacting electronic sy$ with {\it off-diagonal disorder}. For these systems, the disorder can be ``gauged away,''and the spectrum can be mapped completely onto the spectrum of the…
High harmonic generation in solids provides us compact and coherent UV sources. Our simulations illustrate abnormal harmonic yield dependence on the intensity of driving or pre-excitation pulses. A multielectron interference model is…
We study the hyperplane arrangements associated, via the minimal model programme, to symplectic quotient singularities. We show that this hyperplane arrangement equals the arrangement of CM-hyperplanes coming from the representation theory…
This paper studies \emph{Dirichlet arrangements}, a generalization of graphic hyperplane arrangements arising from electrical networks and order polytopes of finite posets. We generalize descriptions of combinatorial features of graphic…
We prove that star-like limit cycles of any planar polynomial system can also be seen either as solutions defined on a given interval of a new associated planar non-autonomous polynomial system or as heteroclinic solutions of a…
In this paper we describe a physical problem, based on electromagnetic fields, whose topological constraints are higher dimensional versions of Kirchhoff's laws, involving $2-$ simplicial complexes embedded in $\mathbb{R} ^3$ rather than…
We exhibit supercritical trade-off for monotone circuits, showing that there are functions computable by small circuits for which any circuit must have depth super-linear or even super-polynomial in the number of variables, far exceeding…
Matroid intersection is a classical optimization problem where, given two matroids over the same ground set, the goal is to find the largest common independent set. In this paper, we show that there exists a certain "sparsifer": a subset of…
It is an attractive hypothesis that the spatial structure of visual cortical architecture can be explained by the coordinated optimization of multiple visual cortical maps representing orientation preference (OP), ocular dominance (OD),…
Our purpose is to study the family of simple undirected graphs whose toric ideal is a complete intersection from both an algorithmic and a combinatorial point of view. We obtain a polynomial time algorithm that, given a graph $G$, checks…
The paper addresses parametric inequality systems described by polynomial functions in finite dimensions, where state-dependent infinite parameter sets are given by finitely many polynomial inequalities and equalities. Such systems can be…
We study point-line configurations through the lens of projective geometry and matroid theory. Our focus is on their realisation spaces, where we introduce the concepts of liftable and quasi-liftable configurations, exploring cases in which…
In 1994, Orlik and Terao introduced a commutative Artinian analog S/I(A) of the Orlik-Solomon algebra of a hyperplane arrangement A to answer a question of Aomoto. A central topic of investigation in the study of Artinian algebras is the…
Polymatroids are combinatorial abstractions of subspace arrangements in the same way that matroids are combinatorial abstractions of hyperplane arrangements. By introducing augmented Chow rings of polymatroids, modeled after augmented…
Let G be a finite simple graph. From the pioneering work of R. P. Stanley it is known that the cycle matroid of G is supersolvable iff G is chordal (rigid): this is another way to read Dirac's theorem on chordal graphs. Chordal binary…
In this paper, we investigate the classes of matroid intersection admitting a solution for the problem of partitioning the ground set $E$ into $k$ common independent sets, where $E$ can be partitioned into $k$ independent sets in each of…
We study the problem of optimizing nonlinear objective functions over matroids presented by oracles or explicitly. Such functions can be interpreted as the balancing of multi-criteria optimization. We provide a combinatorial polynomial time…
One of the main open questions in liaison theory is whether every homogeneous Cohen-Macaulay ideal in a polynomial ring is glicci, i.e. if it is in the G-liaison class of a complete intersection. We give an affirmative answer to this…
We investigate the relationship between ideal membership of an operator and its pieces relative to several canonical types of partitions of the entries of its matrix representation with respect to a given orthonormal basis. Our main…
We study a spectral generalization of classical combinatorial graph spanners to the spectral setting. Given a set of vectors $V\subseteq \Re^d$, we say a set $U\subseteq V$ is an $\alpha$-spectral spanner if for all $v\in V$ there is a…