Related papers: On solving isomorphism problems about 2-designs us…
In this paper, we attach several new invariants to connected strongly regular graphs (excepting conference graphs on non-square number of vertices) : one invariant called the discriminant, and a p-adic invariant corresponding to each prime…
We consider the existence problem for a semi-cyclic holey group divisible design of type (n,m^t) with block size 3, which is denoted by a 3-SCHGDD of type (n,m^t). When t is odd and n\neq 8 or t is doubly even and t\neq 8, the existence…
We present a simplification of the recursive algorithm for the evaluation of intersection numbers for differential $n$-forms, by combining the advantages emerging from the choice of delta-forms as generators of relative twisted cohomology…
We study the relation between the Galois group $G$ of a linear difference-differential system and two classes $\mathcal{C}_1$ and $\mathcal{C}_2$ of groups that are the Galois groups of the specializations of the linear difference equation…
More than $30$ years ago, Delandtsheer and Doyen showed that the automorphism group of a block-transitive $2$-design, with blocks of size $k$, could leave invariant a nontrivial point-partition, but only if the number of points was bounded…
Paul Erd\H{o}s and L\'{a}szl\'{o} Lov\'{a}sz established by means of an example that there exists a maximal intersecting family of $k-$sets with approximately $(e-1)k!$ blocks. L\'{a}szl\'{o} Lov\'{a}sz conjectured that their example is…
The isomorphism problem is known to be efficiently solvable for interval graphs, while for the larger class of circular-arc graphs its complexity status stays open. We consider the intermediate class of intersection graphs for families of…
The main goal of this paper is to formalize and explore a connection between chromatic properties of graphs with geometric representations and competitive analysis of on-line algorithms, which became apparent after the recent construction…
In this article, we investigate $2$-$(v,k,\lambda)$ designs with $\gcd(r,\lambda)=1$ admitting flag-transitive automorphism groups $G$. We prove that if $G$ is an almost simple group, then such a design belongs to one of the seven infinite…
We use Galois descent to construct central extensions of twisted forms of split simple Lie algebras over rings. These types of algebras arise naturally in the construction of Extended Affine Lie Algebras. The construction also gives…
We study the differential Galois theory of difference equations under weaker hypothesis on the field of constants of the automorphism. This framework yields a new approach to results by C.Hardouin and M.Singer, which answers possitively a…
In this paper, we survey constructions of and nonexistence results on combinatorial/geometric structures which arise from unions of cyclotomic classes of finite fields. In particular, we survey both classical and recent results on…
We study the interplay between the differential Galois group and the Lie algebra of infinitesimal symmetries of systems of linear differential equations. We show that some symmetries can be seen as solutions of a hierarchy of linear…
We remove the assumption "let p be odd or k totally imaginary" from several well-known theorems in Galois cohomology of number fields. For example, we show that the Galois group of the maximal extension of a number field k which is…
A problem that arises in drawings of transportation networks is to minimize the number of crossings between different transportation lines. While this can be done efficiently under specific constraints, not all solutions are visually…
We study the problem of existence of one-parameter, linear families of polynomials of degree n all of whose polynomials have Galois group A_n. The methods we use have a strong geometric flavour.
For a finite group $G$, we introduce a generalization of norm relations in the group algebra $\mathbb Q[G]$. We give necessary and sufficient criteria for the existence of such relations and apply them to obtain relations between the…
We construct an explicit isomorphism between (truncations of) quiver Hecke algebras and Elias-Williamson's diagrammatic endomorphism algebras of Bott-Samelson bimodules. As a corollary, we deduce that the decomposition numbers of these…
In this article, we study $2$-designs with $\gcd(r,\lambda)=1$ admitting a flag-transitive almost simple automorphism group with socle a finite simple exceptional group of Lie type. We obtain four infinite families of such designs and…
An important problem in computational arithmetic geometry is to find changes of coordinates to simplify a system of polynomial equations with rational coefficients. This is tackled by a combination of two techniques, called minimisation and…