Related papers: On the non-very generic intersections in discrimin…

In this work we present a general and versatile algorithmic framework for exhaustively generating a large variety of different combinatorial objects, based on encoding them as permutations. This approach provides a unified view on many…

We demonstrate a general gauging procedure of a pure matter theory on a lattice with a mixture of subsystem and global symmetries. This mixed symmetry can be either a semidirect product of a subsystem symmetry and a global symmetry, or a…

We investigate the metric structure of the intersection lattice L(B(n,k)) of the discriminantal arrange ment using circuit supports. We show that the cover graph associated with L(B(n,k)) is isometrically embedded into a hypercube, making…

Given a set $A$ of positive integers $a_1<\cdots<a_k$ and a partition $P: n_1+\cdots+n_k=n$, find the extremal denominators of the regular and semi-regular continued fraction $[0;x_1,\ldots,x_n]$ with partial quotients $x_i\in A$ and where…

Given subvarieties $X, Y$ of a complex algebraic variety $S$ of complementary dimension, must they intersect? When $S$ is projective space, this is a consequence of the classical B\'ezout theorem, and an analogue for simple abelian…

We develop a general theory of Cartesian and non-Cartesian polynomials on products of complex spaces $\mathbb{C}^{n_1} \times \cdots \times \mathbb{C}^{n_k}$. We prove that, for any fixed degree $d \ge 2$, a (Zariski) generic polynomial is…

In this paper we propose an approach to implement specific relation-ship set between two entities called combinatorial relationship set. For the combinatorial relationship set B between entity sets G and I the mapping cardinality is…

For any finite, real reflection group $W$, we construct a geometric basis for the homology of the corresponding non-crossing partition lattice. We relate this to the basis for the homology of the corresponding intersection lattice…

Matroid is a generalization of many fundamental objects in combinatorial mathematics , and matroid intersection problem is a classical subject in combinatorial optimization . However , only the intersection of two matroids are well…

The resonance arrangement $\mathcal{A}_n$ is the arrangement of hyperplanes which has all non-zero $0/1$-vectors in $\mathbb{R}^n$ as normal vectors. It is the adjoint of the Braid arrangement and is also called the all-subsets arrangement.…

Let $k$ be a number field and $B$ be a central simple algebra over $k$ of dimension $p^2$ where $p$ is prime. In the case that $p=2$ we assume that $B$ is not totally definite. In this paper we study sets of pairwise nonisomorphic maximal…

We show that the $A$-optimal design optimization problem over $m$ design points in $\mathbb{R}^n$ is equivalent to minimizing a quadratic function plus a group lasso sparsity inducing term over $n\times m$ real matrices. This observation…

Two arrangements with the same combinatorial intersection lattice but whose complements have different fundamental groups are called a Zariski pair. This work finds that there are at most nine such pairs amongst all ten line arrangements…

An algorithm is demonstrated that finds an ordinary intersection in an arrangement of $n$ lines in $\mathbb{R}^2$, not all parallel and not all passing through a common point, in time $O(n \log{n})$. The algorithm is then extended to find…

In a recent breakthrough, Adiprasito, Avvakumov, and Karasev constructed a triangulation of the $n$-dimensional real projective space with a subexponential number of vertices. They reduced the problem to finding a small downward closed…

Felsner, Hurtado, Noy and Streinu (2000) conjectured that arrangement graphs of simple great-circle arrangements have chromatic number at most $3$. Motivated by this conjecture, we study the colorability of arrangement graphs for different…

Let k be an imaginary quadratic number field, let F be a rational quaternion algebra and M an extension of F as a quaternion k-algebra. We are going to classify the F-orders which arise as an intersection of F with a maximal M-order; and we…

In this paper, we show how one may (efficiently) construct two types of extremal combinatorial objects whose existence was previously conjectural. (*) Panchromatic Graphs: For fixed integer k, a k-panchromatic graph is, roughly speaking, a…

For a real affine hyperplane arrangement, we define an integer intersection matrix with a natural $q$-deformation related to the intersections of bounded chambers of the arrangement. By connecting the integer matrix to a bilinear form of…

The present paper is motivated by the need to generalize the construction of the Scarf complex in order to give combinatorial resolutions of a much broader class of modules than just the monomial ideals. For any subset $A\subseteq…