Related papers: On the non-very generic intersections in discrimin…
Very Special Relativity (VSR) framework, proposed by Cohen and Glashow [1], demonstrated that a proper subgroup of the Poincar\'e group, (in particular ISIM(2)), is sufficient to describe the spacetime symmetries of the so far observed…
So far, most of the literature on (quantum) contextuality and the Kochen-Specker theorem seems either to concern particular examples of contextuality, or be considered as quantum logic. Here, we develop a general formalism for contextuality…
Comparator circuit model was originally introduced by Mayr and Subramanian (1992) (and further studied by Cook, Filmus and Le (2012)) to capture problems which are not known to be P-complete but still not known to admit efficient parallel…
Two families $\mathcal{A}$ and $\mathcal{B}$ of sets are said to be cross-intersecting if each member of $\mathcal{A}$ intersects each member of $\mathcal{B}$. For any two integers $n$ and $k$ with $0 \leq k \leq n$, let ${[n] \choose \leq…
We find an explicit combinatorial gradient vector field on the well known complex S (Salvetti complex) which models the complement to an arrangement of complexified hyperplanes. The argument uses a total ordering on the facets of the…
A combinatorial rectangle may be viewed as a matrix whose entries are all +-1. The discrepancy of an m by n matrix is the maximum among the absolute values of its m row sums and n column sums. In this paper, we investigate combinatorial…
The short and intermediate-range order in GeO$_2$ glass are investigated by molecular dynamics using machine-learning interatomic potential trained on ab initio calculation data and compared with reverse Monte Carlo fitting of neutron…
Improving a result of K\'arolyi, Pach and T\'oth, we construct an arrangement of $n$ segments in the plane with at most $n^{\log{8} / \log{169}}$ pairwise crossing or pairwise disjoint segments. We use the recursive method based on…
In this paper we study a certain generalization of combinatorial designs related to almost difference sets, namely the $t$-adesign, which was coined by Cunsheng Ding in 2015. It is clear that $2$-adesigns are a kind of partially balanced…
In this paper we consider the classic matroid intersection problem: given two matroids $\M_{1}=(V,\I_{1})$ and $\M_{2}=(V,\I_{2})$ defined over a common ground set $V$, compute a set $S\in\I_{1}\cap\I_{2}$ of largest possible cardinality,…
Recently, we have witnessed tremendous applications of algebraic intersection theory to branches of mathematics, that previously seemed very distant. In this article we review some of them. Our aim is to provide a unified approach to the…
Close connections between various notions of entropy and the apparatus of category theory have been observed already in the 1980s and more vigorously developed in the past ten years. The starting point of the paper is the recent categorical…
Following the general strategy proposed by G.Rybnikov, we present a proof of his well-known result, that is, the existence of two arrangements of lines having the same combinatorial type, but non-isomorphic fundamental groups. To do so, the…
In 2005, building on his own recent work and that of F. Zanello, A. Iarrobino discovered some constructions that, he conjectured, would yield level algebras with non-unimodal Hilbert functions. This thesis provides proofs of non-unimodality…
Accidental symmetries in effective field theories can be established by computing and comparing Hilbert series. This invites us to study them with the tools of invariant theory. Applying this technology, we spotlight three classes of…
This paper studies the underlying combinatorial structure of a class of object rearrangement problems, which appear frequently in applications. The problems involve multiple, similar-geometry objects placed on a flat, horizontal surface,…
We classify complex hyperplane arrangements $\mathcal A$ whose intersection posets $L(\mathcal A)$ satisfy $L(\mathcal A)=\pi_i^{-1}\circ\pi_i\bigl(L(\mathcal A)\bigr)$ for $i=1,\dots,n$. Here $\pi_i$ denotes the projection from $\mathbb…
An ordered $r$-matching is an $r$-uniform hypergraph matching equipped with an ordering on its vertices. These objects can be viewed as natural generalisations of $r$-dimensional orders. The theory of ordered 2-matchings is well-developed…
This paper begins by extending the notion of a combinatorial configuration of points and lines to a combinatorial configuration of points and planes that we refer to as configurations of order $2$. We then proceed to investigate a further…
We apply methods of derived and non-commutative algebraic geometry to understand intersection theoretic phenomena on arithmetic schemes. Specifically, we categorify Bloch's intersection number (in the formulation provided by Kato--Saito).…