Related papers: Resonance varieties, admissible line combinatorics…

Modelling compositionality has been a longstanding area of research in the field of vector space semantics. The categorical approach to compositionality maps grammar onto vector spaces in a principled way, but comes under fire for requiring…

The relation between the spectra of operator pencils with unbounded coefficients and of associated linear relations is investigated. It turns out that various types of spectrum coincide and the same is true for the Weyr characteristics.…

Recently, B\'{e}nyi and the second author introduced two combinatorial interpretations for symmetrized poly-Bernoulli polynomials. In the present study, we construct bijections between these combinatorial objects. We also define various…

We study the geometry and cohomology of Lefschetz pencils for semistable schemes over a discrete valuation ring. We relate the global cohomological properties of the Lefschetz pencil and the monodromy-weight conjecture, in particular we…

A rectangulation is a decomposition of a rectangle into finitely many rectangles. Via natural equivalence relations, rectangulations can be seen as combinatorial objects with a rich structure, with links to lattice congruences, flip graphs,…

The need of mathematically formulate relations between composite materials' properties and its resonance response is growing. This is due the fast technological advancement in micro-material manufacturing, present in chips for instance. In…

In this paper we will prove that there exists a covariant functor from the category of schemes to the category of graphs. This functor provides a combination between algebraic varieties and combinatorial graphs so that the invariants…

We introduce an algorithm that exploits a combinatorial symmetry of an arrangement in order to produce a geometric reflection between two disconnected components of its moduli space. We apply this method to disqualify three real examples…

We prove that the existence of finite combinatorial objects such as affine planes, mutually orthogonal Latin squares, and resolvable balanced incomplete block designs can be reformulated as the existence of certain algorithmic reductions…

We solve the problem of characterizing the Kronecker structure of a matrix pencil obtained by a rank-one perturbation of another matrix pencil. The results hold over arbitrary fields.

We give a combinatorial characterization of generic minimal rigidity for planar periodic frameworks. The characterization is a true analogue of the Maxwell-Laman Theorem from rigidity theory: it is stated in terms of a finite combinatorial…

A combinatorial object representing schemas of, possibly skew, perspectives, called {\em a configuration of skew perspective} has been defined in \cite{klik:binom}, \cite{maszko}. Here we develop the theory of configurations generalizing…

The theory of limits of discrete combinatorial objects has been thriving for the last decade or so. The syntactic, algebraic approach to the subject is popularly known as "flag algebras", while the semantic, geometric one is often…

Bound, antibound and resonance states are associated to poles in the on-shell partial wave amplitudes. We show here that from the residues of the pole a rank 1 projection operator associated with any of these states can be extracted, in…

This paper aims to study canonical pencils of higher dimensional projective varieties. It seems that the geometric genus of the general fibre for the derived fibration from the canonical pencil for a 3-fold of general type does not have an…

For line arrangements in P^2 with nice combinatorics (in particular, for those which are nodal away the line at infinity), we prove that the combinatorics contains the same information as the fundamental group together with the meridianal…

The goal of this note is to present a combinatorial mechanism for counting certain objects associated to a variety X defined over a finite field. The basic example is that of counting conjugacy classes in GL_n(F_q), where X is the…

The problem of classifying linear systems of conics in projective planes dates back at least to Jordan, who classified pencils (one-dimensional systems) of conics over $\mathbb{C}$ and $\mathbb{R}$ in 1906--1907. The analogous problem for…

Any traditional classification problem in general involves modelling individual classes and in turn classification by evaluating the similarity of the test set with the modelled classes. In this paper, we introduce another approach that…

In this paper, we define locally matchable subsets of a group which is extracted from the concept of matchings in groups and used as a tool to give alternative proofs for existing results in matching theory. We also give the linear analogue…