相关论文: On the non-very generic intersections in discrimin…

We study the combinatorics of hyperplane arrangements over arbitrary fields. Specifically, we determine in which situation an arrangement and its reduction modulo a prime number have isomorphic lattices via the use of minimal strong…

Let $G$ be a connected graph. The Jacobian group (also known as the Picard group or sandpile group) of $G$ is a finite abelian group whose cardinality equals the number of spanning trees of $G$. The Jacobian group admits a canonical simply…

Let B(n) be the set of pairs of permutations from the symmetric group of degree n with a 3-cycle commutator, and let A(n) be the set of those pairs which generate the symmetric or the alternating group of degree n. We find effective…

Generalizing the famous Bernstein-Kushnirenko Theorem, Khovanskii proved in 1978 a combinatorial formula for the arithmetic genus of the compactification of a generic complete intersection associated to a family of lattice polytopes.…

The $s$-point correlation function of a Gaussian Hermitian random matrix theory, with an external source tuned to generate a multi-critical singularity, provides the intersection numbers of the moduli space for the $p$-th spin curves…

In this paper, the fourth in the series, we continue our study of combinatorics in chaotic Newtonian dynamics. We focus once again on the chaotic four-body problem in Newtonian gravity assuming finite-sized particles, and interactions that…

It is well known that not every combinatorial configuration admits a geometric realization with points and lines. Moreover, some of them do not even admit realizations with pseudoline arrangements, i.e., they are not topological. In this…

In this paper we study two directions of extending the classical Erd\H os-Ko-Rado theorem which states that any family of $k$-element subsets of the set $[n] = \{1,\ldots,n\}$ in which any two sets intersect, has cardinality at most…

For $K$ an abstract elementary class with amalgamation and no maximal models, we show that categoricity in a high-enough cardinal implies structural properties such as the uniqueness of limit models and the existence of good frames. This…

Hyperplane arrangements form the geometric counterpart of combinatorial objects such as matroids. The shape of the sequence of Betti numbers of the complement of a hyperplane arrangement is of particular interest in combinatorics, where…

In 2017, Green and Schroll introduced a generalization of Brauer graph algebras which they call Brauer configuration algebras. In the present paper, we further generalize Brauer configuration algebras to fractional Brauer configuration…

We investigate two fundamental questions intersecting coding theory and combinatorial geometry, with emphasis on their connections. These are the problem of computing the asymptotic density of MRD codes in the rank metric, and the Critical…

Block-transitive Steiner $t$-designs form a central part of the study of highly symmetric combinatorial configurations at the interface of several disciplines, including group theory, geometry, combinatorics, coding and information theory,…

Consider the collection of hyperplanes in $\mathbb{R}^n$ whose defining equations are given by $\{x_i + x_j = 0\mid 1\leq i<j\leq n\}$. This arrangement is called the threshold arrangement since its regions are in bijection with labeled…

This paper gives a geometric interpretation of the notion of quasi-symmetric representation and uses this to show that the discriminant locus associated to such a representation is a hyperplane arrangement. Moreover, we identify this…

The notion of abundance of certain type of configuration in certain large sets was first proved by Furstenberg and Glazner in 1998. After that many author investigate abundance of different types of configurations in different types of…

We introduce a new class of line arrangements in the projective plane, called nearly supersolvable, and show that any arrangement in this class is either free or nearly free. More precisely, we show that the minimal degree of a Jacobian…

Recently there has been several works estimating the number of $n\times n$ matrices with elements from some finite sets $\mathcal X$ of arithmetic interest and of a given determinant. Typically such results are compared with the trivial…

Intersecting codes are linear codes where every two nonzero codewords have non-trivially intersecting support. In this article we expand on the theory of this family of codes, by showing that nondegenerate intersecting codes correspond to…

A new measure of non-classical correlations is introduced and characterized. It tests the ability of using a state {\rho} of a composite system AB as a probe for a quantum illumination task [e.g. see S. Lloyd, Science 321, 1463 (2008)], in…