相关论文: Combinatorial characterzations of $T$-designs in t…
The Erd\H{o}s--Ko--Rado theorem is extended to designs in semilattices with certain conditions. As an application, we show the intersection theorems for the Hamming schemes, the Johnson schemes, bilinear forms schemes, Grassmann schemes,…
We discuss metric and combinatorial properties of Thompson's group T, including normal forms for elements and unique tree pair diagram representatives. We relate these properties to those of Thompson's group F when possible, and highlight…
We present an accurate investigation of the algebraic conditions that the symbols of a convergent, univariate, binary, non-stationary subdivision scheme should fulfill in order to reproduce spaces of exponential polynomials. A subdivision…
Binary self-orthogonal codes and balanced incomplete block designs are two combinatorial configurations that have been much studied because of their wide areas of application. In this paper, we have shown the distribution of (16; 6;…
We estimate the number $|\mathcal{A}_{\boldsymbol\lambda}|$ of elements on a nonlinear family $\mathcal{A}$ of monic polynomials of $\mathbb{F}_q[T]$ of degree $r$ having factorization pattern…
We develop a marking system for an analog of Hasse diagrams of intervals $[u,v]$ with $u\leq v$ in a Hermitian symmetric pair $W/W_J$, and use this to create a closed form algorithm for computing relative R-polynomials. The uniform nature…
The incomplete tribonacci polynomials, denoted by T_n^{(s)}(x), generalize the usual tribonacci polynomials T_n(x) and were introduced in [10], where several algebraic identities were shown. In this paper, we provide a combinatorial…
Combinatorial $t$-designs have nice applications in coding theory, finite geometries and several engineering areas. The objective of this paper is to study how to obtain $3$-designs with $2$-transitive permutation groups. The incidence…
In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of $n$ definable sets belonging to some fixed definable family of sets in an o-minimal structure. This generalizes the…
Various specifiable combinatorial structures, with d extensive parameters, can be exactly sampled both by the recursive method, with linear arithmetic complexity if a heavy preprocessing is performed, or by the Boltzmann method, with…
The famous Johnson-Lindenstrauss lemma states that for any set of n vectors, there is a linear transformation into a space of dimension O(log n) that approximately preserves all their lengths. In fact, a Haar random unitary transformation…
Ritt-Wu's algorithm of characteristic sets is the most representative for triangularizing sets of multivariate polynomials. Pseudo-division is the main operation used in this algorithm. In this paper we present a new algorithmic scheme for…
We introduce a general framework to deterministically construct binary measurement matrices for compressed sensing. The proposed matrices are composed of (circulant) permutation submatrix blocks and zero submatrix blocks, thus making their…
Large sets of combinatorial designs has always been a fascinating topic in design theory. These designs form a partition of the whole space into combinatorial designs with the same parameters. In particular, a large set of block designs,…
Coding theory and combinatorial $t$-designs have close connections and interesting interplay. One of the major approaches to the construction of combinatorial t-designs is the employment of error-correcting codes. As we all known, some…
We introduce the notion of a combinatorial inverse system in non-commutative variables. We present two important examples, some conjectures and results. These conjectures and results were suggested and supported by computer investigations.
One of the most central and long-standing open questions in combinatorial design theory concerns the existence of Steiner t-designs for large values of t. Although in his classical 1987 paper, L. Teirlinck has shown that non-trivial…
Association schemes are central objects in algebraic combinatorics, with the classical schemes lying at their core. These classical association schemes essentially consist of the Hamming and Johnson schemes, and their $q$-analogs: bilinear…
A $t$-$(n,k,\lambda)$ design over $\F_q$ is a collection of $k$-dimensional subspaces of $\F_q^n$, called blocks, such that each $t$-dimensional subspace of $\F_q^n$ is contained in exactly $\lambda$ blocks. Such $t$-designs over $\F_q$ are…
The first half of this paper is largely expository, wherein we present a systematic combinatorial approach to the theory of polynomial (semi)invariants and multilinear invariants of several vectors and covectors, for the classical groups.…