Related papers: Some results on the Ryser design conjecture

The detection of weak and rare effects in large amounts of data arises in a number of modern data analysis problems. Known results show that in this situation the potential of statistical inference is severely limited by the large-scale…

This paper is a study of the so-called `ricochet configuration' (or $R$-configuration) which arises in the context of Pascal's theorem. We give a geometric proof of the fact that a specific pair of Pascal lines is coincident for a sextuple…

Burr and Erd\H{o}s in 1975 conjectured, and Chv\'atal, R\"odl, Szemer\'edi and Trotter later proved, that the Ramsey number of any bounded degree graph is linear in the number of vertices. In this paper, we disprove the natural directed…

From the point of view of optimization, a critical issue is relating the combinatorial diameter of a polyhedron to its number of facets $f$ and dimension $d$. In the seminal paper of Klee and Walkup [KW67], the Hirsch conjecture of an upper…

Multidimensional record patterns are random sets of lattice points defined by means of a recursive stochastic construction. The patterns thus generated owe their richness to the fact that the construction is not based on a total order,…

Within this research, two combinatorial bijections using Young diagrams were studied. The first is a special case of a bijective correspondence between two classes of combinatorial objects. Its proof, based on Young diagrams, establishes…

Graph theory and enumerative combinatorics are two branches of mathematical sciences that have developed astonishingly over the past one hundred years. It is especially important to point out that graph theory employs combinatorial…

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…

Within a framework of noncommutative geometry, we develop an analogue of (pseudo) Riemannian geometry on finite and discrete sets. On a finite set, there is a counterpart of the continuum metric tensor with a simple geometric…

Symmetry detection and discrimination are of fundamental meaning in science, technology, and engineering. This paper introduces reflection invariants and defines the directional moment to detect symmetry for shape analysis and object…

Let $v_1, ..., v_m$ be a finite set of unit vectors in $\RR^n$. Suppose that an infinite sequence of Steiner symmetrizations are applied to a compact convex set $K$ in $\RR^n$, where each of the symmetrizations is taken with respect to a…

The Alperin--McKay conjecture relates irreducible characters of a block of an arbitrary finite group to those of its $p$-local subgroups. A refinement of this conjecture was stated by the author in a previous paper. We prove that this…

The paper deals with recursive constructions for simple 3-designs based on other 3-designs having $(1, \sigma)$-resolution. The concept of $(1, \sigma)$-resolution may be viewed as a generalization of the parallelism for designs. We show…

Let $G=(V,E)$ be a simple connected graph. A set of vertices $S\subseteq V$ is said to be a dominating set if for any vertex in $V\setminus S$ is adjacent to at least one vertex in $S$. The domination number $\gamma(G)$ of $G$ is the…

Multidimensional combinatorial substitutions are rules that replace symbols by finite patterns of symbols in $\mathbb Z^d$. We focus on the case where the patterns are not necessarily rectangular, which requires a specific description of…

We explore the relation between various versions of Ramsey theorem and bounding schemes in model ${N}$ of a fragment of arithmetic $F$. Our goal is to recast, in a different framework, and extend some results of Hirst \cite{Hirst-1987}, see…

We prove the existence conjecture for combinatorial designs, answering a question of Steiner from 1853. More generally, we show that the natural divisibility conditions are sufficient for clique decompositions of simplicial complexes that…

Symmetry is an important feature of many constraint programs. We show that any problem symmetry acting on a set of symmetry breaking constraints can be used to break symmetry. Different symmetries pick out different solutions in each…

Graphlets are subgraphs rooted at a fixed vertex. The number of occurrences of graphlets aligned to a particular vertex, called graphlet degree sequence (gds), gives a topological description of the surrounding of the analyzed vertex.…

Given an integer $k\ge3$ and a group $G$ of odd order, if there exists a $2$-$(v,k,1)$-design and if $v$ is sufficiently large, then there is such a design whose automorphism group has a subgroup isomorphic to $G$. A weaker result is proved…