Related papers: Root Cones and the Resonance Arrangement
A simple heuristic argument to understand the existence of complex branch points in the $\pi N$ scattering amplitude is presented. It is based on a hypothesis that the singularity structure of the $\pi N$ scattering amplitude is a smooth…
We undertake a detailed numerical study of the twin phenomena of stochastic and vibrational resonance in a discrete model system in the presence of bichromatic input signal. A two parameter cubic map is used as the model that combines the…
We present some new results about the resonance varieties of matroids and hyperplane arrangements. Though these have been the objects of ongoing study, most work so far has focussed on cohomological degree 1. We show that certain phenomena…
A hyperplane arrangement in $\mathbb{R}^n$ is a finite collection of affine hyperplanes. Counting regions of hyperplane arrangements is an active research direction in enumerative combinatorics. In this paper, we consider the arrangement…
A common theme of enumerative combinatorics is formed by counting functions that are polynomials evaluated at positive integers. In this expository paper, we focus on four families of such counting functions connected to hyperplane…
Local resonance band gaps in acoustic metamaterials are widely known for their strong attenuation yet narrow frequency span. The latter limits the practical ability to implement subwavelength band gaps for broadband attenuation and has…
We study the moduli space of logarithmic connections of rank $2$ on $\mathbb{P}^1 \setminus \{ t_1, \dots, t_5 \}$ with fixed spectral data. The aim of this paper is to compute the cohomology of such space, and this computation will be used…
The coefficients of the chain polynomial of a finite poset enumerate chains in the poset by their number of elements. It has been a challenging open problem to determine which posets have real-rooted chain polynomials. Two new classes of…
Using a Multiple Scattering Theory algorithm, we investigate numerically the transmission of ultrasonic waves through a disordered locally resonant metamaterial containing only monopolar resonators. By comparing the cases of a perfectly…
We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…
The polytope structure of the associahedron is decomposed into two categories, types and classes. The classification of types is related to integer partitions, whereas the classes present a new combinatorial problem. We solve this and…
The method of calculation of the resonance characteristics is developed for the metastable states of the Coulomb three-body (CTB) system with two disintegration channels. The energy dependence of K-matrix in the resonance region is…
Suppose f is a real univariate polynomial of degree D with exactly 4 monomial terms. We present an algorithm, with complexity polynomial in log D on average (relative to the stable log-uniform measure), for counting the number of real roots…
This article introduces a finite piecewise Euclidean cell complex homeomorphic to the space of monic centered complex polynomials of degree $d$ whose critical values lie in a fixed closed rectangular region. We call this the branched…
We observe resonant tunneling in silicon split gate point contacts implanted with antimony and defined in a self-aligned poly-silicon double gate enhancement mode Si-MOS device structure. We identify which resonances are likely candidates…
Read-once Oblivious Algebraic Branching Programs (ROABPs) compute polynomials as products of univariate polynomials that have matrices as coefficients. In an attempt to understand the landscape of algebraic complexity classes surrounding…
We study the harmonic polytope, which arose in Ardila, Denham, and Huh's work on the Lagrangian geometry of matroids. We describe its combinatorial structure, showing that it is a $(2n-2)$-dimensional polytope with…
We define an n-dimensional polytope Pi_n(x), depending on parameters x_i>0, whose combinatorial properties are closely connected with empirical distributions, plane trees, plane partitions, parking functions, and the associahedron. In…
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…
The mixed volume counts the roots of generic sparse polynomial systems. Mixed cells are used to provide starting systems for homotopy algorithms that can find all those roots, and track no unnecessary path. Up to now, algorithms for that…