Related papers: On the automorphism groups of Lunardon-Polverino s…
We study two kinds of generalizations of symmetric block designs to higher dimensions, the so-called $\mathcal{C}$-cubes and $\mathcal{P}$-cubes. For small parameters, all examples up to equivalence are determined by computer calculations.…
We look at AG codes associated to the projective line, re-examining the problem of determining their automorphism groups (originally investigated by Duer in 1987 using combinatorial techniques) using recent methods from algebraic geometry.…
There has been a lot of interest recently in proving lower bounds on the size of linear programs needed to represent a given polytope P. In a breakthrough paper Fiorini et al. [Proceedings of 44th ACM Symposium on Theory of Computing 2012,…
It is well-known that the representation theory of the finite group of unipotent upper-triangular matrices $U_n$ over a finite field is a wild problem. By instead considering approximately irreducible representations (supercharacters), one…
Let $I(X,R)$ be the incidence algebra of the preordered set $X$ over the ring $R$. In the case of a finite connected partially ordered set $X$, we prove that the subgroup of inner multiplicative automorphisms is a direct factor of the group…
Finite quasi semimetrics on $n$ can be thought of as nonnegative valuations on the edges of a complete directed graph on $n$ vertices satisfying all possible triangle inequalities. They comprise a polyhedral cone whose symmetry groups were…
In the last decade, there has been a continued effort to produce families of strong linearizations of a matrix polynomial $P(\lambda)$, regular and singular, with good properties. As a consequence of this research, families such as the…
Low-density parity-check codes together with belief propagation (BP) decoding are known to be well-performing for large block lengths. However, for short block lengths there is still a considerable gap between the performance of the BP…
We describe the adjacency of vertices of the (unbounded version of the) set covering polyhedron, in a similar way to the description given by Chvatal for the stable set polytope. We find a sufficient condition for adjacency, and…
A partial linear space is a point--line incidence structure such that each line is incident with at least two points and each pair of points is incident with at most one line. It is said to be proper if there exists at least one…
We compute the automorphism group of the dual complex $\mathsf{T}_{d, n}$ of the boundary divisor in the Kontsevich moduli space $\overline{\mathcal{M}}_{0, n}(\mathbb{P}^r, d)$. When $d \geq 2$, we find that $\mathrm{Aut}(\mathsf{T}_{d,…
The obstruction set for graphs with knotless embeddings is not known, but a recent paper of Goldberg, Mattman, and Naimi indicates that it is quite large. Almost all known obstructions fall into four Triangle-Y families and they ask if…
The NP-hard Maximum Planar Subgraph problem asks for a planar subgraph $H$ of a given graph $G$ such that $H$ has maximum edge cardinality. For more than two decades, the only known non-trivial exact algorithm was based on integer linear…
We investigate graded retracts of polytopal algebras (essentially the homogeneous rings of affine cones over projective toric varieties) as polytopal analogues of vector spaces. In many cases we show that these retracts are again polytopal…
This work addresses the questions: (i) Among all left-invariant Riemannian metrics on a given Lie group, is there any whose isometry group or isometry algebra contain that of all others? (ii) Do expanding left-invariant Ricci solitons…
In this paper we are concerned with determining lower bounds of the number of limit cycles for piecewise polynomial holomorphic systems with a straight line of discontinuity. We approach this problem with different points of view: study of…
In order to prove new existence results in Brill-Noether theory for rank-2 vector bundles with fixed special determinant, we develop foundational definitions and results for limit linear series of higher-rank vector bundles. These include…
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. These…
In this memoir, we study the even unimodular lattices of rank at most 24, as well as a related collection of automorphic forms of the orthogonal, symplectic and linear groups of small rank. Our guide is the question of determining the…
For an arbitrary $q$-polynomial $f$ over $\mathbb{F}_{q^n}$ we study the problem of finding those $q$-polynomials $g$ over $\mathbb{F}_{q^n}$ for which the image sets of $f(x)/x$ and $g(x)/x$ coincide. For $n\leq 5$ we provide sufficient…