Related papers: Irreducibility of configurations

We study the notion of irreducibility of semigroup morphisms. Given an alphabet $\Sigma$, a morphism $\varphi:\Sigma^+\rightarrow\Sigma^+$ is irreducible if any factorisation $\varphi=\psi_2\circ\psi_1$ can only be satisfied if $\psi_1$ or…

If $L$ is a relational language, then an $L$-structure ${\mathbb X}=\langle X,\bar \rho \rangle$ is reversible iff there is no interpretation $\bar \sigma \varsubsetneq \bar \rho$ such that the structures $\langle X,\bar \sigma \rangle$ and…

It has been conjectured that if the number of distinct irreducible constituents of the product of two faithful irreducible characters of a finite $p$-group, for $p\geq5$, is bigger than $(p+1)/2$, then it is at least $p$. We give a…

A subset $S$ of a cardinal $\kappa$ is Ramsey if for every function $f:[S]^{<\omega}\to \kappa$ with $f(a)<\min a$ for all $a\in[S]^{<\omega}$, there is a set $H\subseteq S$ of cardinality $\kappa$ which is \emph{homogeneous} for $f$,…

We give an elementary proof of a Caratheodory-type result on the invertibility of a sum of matrices, due first to Facchini and Barioli. The proof yields a polynomial identity, expressing the determinant of a large sum of matrices in terms…

Fix any algebraic extension $\mathbb K$ of the field $\mathbb Q$ of rationals. In this article we study exponential sets $V\subset \mathbb R^n$. Such sets are described by the vanishing of so called exponential polynomials, i.e.,…

We give a classification of ordered five points in $\mathbb P^3$ under the diagonal action of $GL_4$ over an algebraically closed field of characteristic $0$, by an explicit description of the diagonal action of $GL_4$ on the quintuple of…

Steiner triple systems form one of the most studied classes of combinatorial designs. Configurations, including subsystems, play a central role in the investigation of Steiner triple systems. With sporadic instances of small systems, ad-hoc…

For any n>3, we give a family of finite dimensional irreducible representations of the braid group B_n. Moreover, we give a subfamily parametrized by 0<m<n of dimension the combinatoric number (n,m). The representation obtained in the case…

We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries and their generalizations or elliptic semiplanes are constructed.…

We study groups of germs of complex diffeomorphisms having a property called irreducibility. The notion is motivated by a similar property of the fundamental group of the complement of an irreducible hypersurface in the complex projective…

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…

H. Lenstra has pointed out that a cubic polynomial of the form (x-a)(x-b)(x-c) + r(x-d)(x-e), where {a,b,c,d,e} is some permutation of {0,1,2,3,4}, is irreducible modulo 5 because every possible linear factor divides one summand but not the…

In [8] the second and third authors showed that if the least inaccessible cardinal is the least measurable cardinal, then there is an inner model with $o(\kappa)\geq2$. In this paper we improve this to $o(\kappa)\geq\kappa+1$ and show that…

While Peano's negative attitude towards infinitesimals, in particular, geometric infinitesimals, is widely documented, his conception of a single infinite cardinality and, more generally, his views on the infinite, are a lot less known. The…

We consider the problem of enumerating d-irreducible maps, i.e. planar maps whose all cycles have length at least d, and such that any cycle of length d is the boundary of a face of degree d. We develop two approaches in parallel: the…

A two-dimensional configuration is a coloring of the infinite grid Z^2 with finitely many colors. For a finite subset D of Z^2, the D-patterns of a configuration are the colored patterns of shape D that appear in the configuration. The…

We classify the 5-dimensional homogeneous geometries in the sense of Thurston. The present paper (part 3 of 3) classifies those in which the linear isotropy representation is nontrivial but reducible. Most of the resulting geometries are…

Constructing $r$-th nonresidue over a finite field is a fundamental computational problem. A related problem is to construct an irreducible polynomial of degree $r^e$ (where $r$ is a prime) over a given finite field $\mathbb{F}_q$ of…

We introduce a reducibility on classes of structures, essentially a uniform enumeration reducibility. This reducibility is inspired by the Friedman-Stanley paper on using Borel reductions to compare classes of countable structures. This…