相关论文: On combinatorics of plus-one generated line arrang…

We introduce and investigate binary $(k,k)$-designs -- combinatorial structures which are related to binary orthogonal arrays. We derive general linear programming bound and propose as a consequence a universal bound on the minimum possible…

A combinatorial methods are used to investigate some properties of certain generalized Stirling numbers, including explicit formula and recurrence relations. Furthermore, an expression of these numbers with symmetric function is deduced.

In this paper we investigate special arrangements of lines in multiprojective spaces. In particular, we characterize codimensional two arithmetically Cohen-Macaulay (ACM) varieties in $\mathbb P^1\times\mathbb P^1\times\mathbb P^1$, called…

This paper introduces a new systematic algorithm for constructing periodic Euclidean weaving diagrams with combinatorial arguments. It is shown that such a weaving diagram can be considered as a specific type of four-regular periodic planar…

Linear quasi-cyclic product codes over finite fields are investigated. Given the generating set in the form of a reduced Gr{\"o}bner basis of a quasi-cyclic component code and the generator polynomial of a second cyclic component code, an…

In this article we combinatorially describe the triangles that are present in two types of line arrangements, those which have global cyclicity and those which are infinity type line arrangements. A combinatorial nomenclature has been…

This work is a study of polynomial compositions having a fixed number of terms. We outline a recursive method to describe these characterizations, give some particular results and discuss the general case. In the final sections, some…

Several articles deal with tilings with various shapes, and also a very frequent type of combinatorics is to examine the walks on graphs or on grids. We combine these two things and give the numbers of the shortest walks crossing the tiled…

The purpose of this work is to collect in one place available information on line arrangements known in the literature as braid, monomial, Ceva or Fermat arrangement. They have been studied for a long time and appeared recently in…

We present some combinatorial interpretations for coefficients appearing in series partitioning the permutations avoiding 132 along marked mesh patterns. We identify for patterns in which only one parameter is non zero the combinatorial…

We introduce a functorial construction $\mathsf{C}$ which takes unitary magmas $\mathcal{M}$ as input and produces operads. The obtained operads involve configurations of chords labeled by elements of $\mathcal{M}$, called…

We suggest a new definition for discrete minimal surfaces in terms of sphere packings with orthogonally intersecting circles. These discrete minimal surfaces can be constructed from Schramm's circle patterns. We present a variational…

We survey interactions between the topology and the combinatorics of complex hyperplane arrangements. Without claiming to be exhaustive, we examine in this setting combinatorial aspects of fundamental groups, associated graded Lie algebras,…

We study combinatorics of billiard partitions which arose recently in the description of periodic trajectories of ellipsoidal billiards in d-dimensional Euclidean and pseudo-Euclidean spaces. Such partitions uniquely codify the sets of…

We introduce bud generating systems, which are used for combinatorial generation. They specify sets of various kinds of combinatorial objects, called languages. They can emulate context-free grammars, regular tree grammars, and synchronous…

It is known that cyclic arrangements are the only {\em unavoidable} simple arrangements of pseudolines: for each fixed $m\ge 1$, every sufficiently large simple arrangement of pseudolines has a cyclic subarrangement of size $m$. In the same…

We propose new linear combinations of compositions of a basic second-order scheme with appropriately chosen coefficients to construct higher order numerical integrators for differential equations. They can be considered as a generalization…

We give a purely combinatorial proof of the Glaisher-Crofton identity which derives from the analysis of discrete structures generated by iterated second derivative. The argument illustrates utility of symbolic and generating function…

Let $S$ be a finite subset of ${\mathbb R}^2 \setminus (0,0)$. Generally, one would expect the pattern of lines $Ax + By = 1$, where $(A, B) \in S$ to contain polygons of all shapes and sizes. We show, however, that when $S$ is a…

We study generalized sums of linear orders. These are binary operations that, given linear orders $A$ and $B$, return an order $A \oplus B$ that can be decomposed as an isomorphic copy of $A$ interleaved with a copy of $B$. We show that…