Related papers: On the automorphism groups of Lunardon-Polverino s…

In recent years, we have seen several approaches to the graph isomorphism problem based on "generic" mathematical programming or algebraic (Gr\"obner basis) techniques. For most of these, lower bounds have been established. In fact, it has…

In this paper we consider some classical varieties of linear algebras over the field which has characteristic 0. For every considered variety we take a category of the finite generated free algebras of this variety. And for every this…

We construct, for any positive integer n, a family of n congruent convex polyhedra in R^3, such that every pair intersects in a common facet. Previously, the largest such family contained only eight polytopes. Our polyhedra are Voronoi…

Knowing the symmetries of a polyhedron can be very useful for the analysis of its structure as well as for practical polyhedral computations. In this note, we study symmetry groups preserving the linear, projective and combinatorial…

We investigate the number of maximal cliques, i.e., cliques that are not contained in any larger clique, in three network models: Erd\H{o}s-R\'enyi random graphs, inhomogeneous random graphs (also called Chung-Lu graphs), and geometric…

The notion of a Riordan graph was introduced recently, and it is a far-reaching generalization of the well-known Pascal graphs and Toeplitz graphs. However, apart from a certain subclass of Toeplitz graphs, nothing was known on independent…

We investigate symmetric edge polytopes generated by Erd\H{o}s--R\'enyi random graphs in a high-dimensional regime. These objects provide a natural and largely unexplored model of random lattice polytopes, in which geometric properties are…

We consider a one-parametric series of left-invariant Lorentzian structures on the universal covering of the Lie group SL(2,R). These structures have SO(1,1)-symmetry and they are deformations of the anti-de Sitter Lorentzian manifold. We…

We show that the sequence of dimensions of the linear spaces, generated by a given rank-metric code together with itself under several applications of a field automorphism, is an invariant for the whole equivalence class of the code. The…

In the recent paper [Duff I. et al, SIAM J. Sci. Comp., 37(3) (2015), A1248-A1269] the authors proposed an interesting procedure for the parallel solution of large, sparse consistent linear systems of equations. In this respect, according…

Linear sets on the projective line have attracted a lot of attention because of their link with blocking sets, KM-arcs and rank-metric codes. In this paper, we study linear sets having two points of complementary weight, that is with two…

We present a geometric approach towards derandomizing the Isolation Lemma by Mulmuley, Vazirani, and Vazirani. In particular, our approach produces a quasi-polynomial family of weights, where each weight is an integer and quasi-polynomially…

We study (inhomogeneous) approximation for systems of linear forms using integer points which satisfy additional primitivity constraints. The first family of primitivity constraints we consider were introduced in 2015 by Dani, Laurent, and…

This paper exploits adjacencies between the orbits of an ordered set P and a consequence of the classification of finite simple groups to, in many cases, exponentially bound the number of automorphisms. Results clearly identify the…

Given a combinatorial optimization problem $\Pi$ and an increasing finite sequence $c$ of natural numbers, we obtain a cardinality constrained version $\Pi_c$ of $\Pi$ by permitting only those feasible solutions of $\Pi$ whose cardinalities…

We say that a linear space is harmonious if it is resolvable and admits an automorphism group acting sharply transitively on the points and transitively on the parallel classes. Generalizing old results by the first author et al. we present…

Let K be a cyclic Galois extension of degree f over k and T a generator of the Galois group. For any v=(v_1,... , v_m)\in K^m such that v is linearly independent over k, and any 0< d < m the Gabidulin-like code C(v, T , d) is a maximum rank…

A graph $G$ is \textit{asymmetric} if its automorphism group of vertices is trivial. Asymmetric graphs were introduced by Erd\H{o}s and R\'{e}nyi in 1963. They showed that the probability of a graph on $n$ vertices being asymmetric tends to…

We study the symmetric tensor rank of multiplication over finite field extensions using linearized polynomials. Via field trace, symmetric linearized polynomials are identified with symmetric bilinear forms and symmetric matrices, allowing…

In this paper, we present new efficiently solvable cases of the Minimum Uncovering Branching problem, an optimization problem with applications in cancer genomics introduced by Hujdurovi\'c, Husi\'c, Milani\v{c}, Rizzi, and Tomescu in 2018.…