Related papers: On the Peterson hit problem

We find the minimal non-trivial integer variable group determinant for any dihedral group of order less than $3.79\times 10^{47}$. We think of this as the Lind-Lehmer problem for the dihedral group. We give a complete description of the…

Let $k$ be a number field, suppose that $B$ is a central simple division algebra over $k$, and choose any maximal order $\mathcal{D}$ of $B$. The object of this paper is to show that the group $\mathcal{D}_S^*$ of $S$-units of $B$ is…

We prove a $p$-adic version of the Integral Geometry Formula for averaging the intersection of two $p$-adic projective algebraic sets. We apply this result to give bounds on the number of points in the modulo $p^m$ reduction of a projective…

The Consensus Clustering problem has been introduced as an effective way to analyze the results of different microarray experiments. The problem consists of looking for a partition that best summarizes a set of input partitions (each…

In this paper, a piecewise quadratic nonconforming finite element method on rectangular grids for a fourth-order elliptic singular perturbation problem is presented. This proposed method is robustly convergent with respect to the…

We introduce a new variant of the art gallery problem that comes from safety issues. In this variant we are not interested in guard sets of smallest cardinality, but in guard sets with largest possible distances between these guards. To the…

We study the minimal bigraded free resolution of an ideal with three generators of the same bidegree, contained in the bihomogeneous maximal ideal $ \langle s,t\rangle \cap \langle u,v \rangle$ of the bigraded ring K[s,t;u,v]. Our analysis…

Elementary symmetric polynomials $S_n^k$ are used as a benchmark for the bounded-depth arithmetic circuit model of computation. In this work we prove that $S_n^k$ modulo composite numbers $m=p_1p_2$ can be computed with much fewer…

The input to the \emph{sets-$k$-means} problem is an integer $k\geq 1$ and a set $\mathcal{P}=\{P_1,\cdots,P_n\}$ of sets in $\mathbb{R}^d$. The goal is to compute a set $C$ of $k$ centers (points) in $\mathbb{R}^d$ that minimizes the sum…

The hitting set problem asks for a collection of sets over a universe $U$ to find a minimum subset of $U$ that intersects each of the given sets. It is NP-hard and equivalent to the problem set cover. We give a branch-and-bound algorithm to…

Polynomials with values in an irreducible module of the symmetric group can be given the structure of a module for the rational Cherednik algebra, called a standard module. This algebra has one free parameter and is generated by…

This paper presents the design and analysis of a Hybrid High-Order (HHO) approximation for a distributed optimal control problem governed by the Poisson equation. We propose three distinct schemes to address unconstrained control problems…

This paper is about minimum cost constrained selection of inputs and outputs for generic arbitrary pole placement. The input-output set is constrained in the sense that the set of states that each input can influence and the set of states…

For a finite set $\mathcal{F}$ of graphs, the $\mathcal{F}$-Hitting problem aims to compute, for a given graph $G$ (taken from some graph class $\mathcal{G}$) of $n$ vertices (and $m$ edges) and a parameter $k\in\mathbb{N}$, a set $S$ of…

For a fixed graph $H$, the $H$-SUBGRAPH HITTING problem consists in deleting the minimum number of vertices from an input graph to obtain a graph without any occurrence of $H$ as a subgraph. This problem can be seen as a generalization of…

We study the electrical distribution network reconfiguration problem, defined as follows. We are given an undirected graph with a root vertex, demand at each non-root vertex, and resistance on each edge. Then, we want to find a spanning…

Symmetries occur naturally in CSP or SAT problems and are not very difficult to discover, but using them to prune the search space tends to be very challenging. Indeed, this usually requires finding specific elements in a group of…

$ \newcommand{\inparen}[1]{\left( #1 \right)} \newcommand{\pfrac}[2]{\inparen{\frac{1}{2}}} \newcommand{\ilog}[1]{\log^{\circ #1}} \newcommand{\F}{\mathbb{F}} $The Polynomial Identity Lemma (also called the "Schwartz--Zippel lemma") states…

When we consider a finite abelian group acting linearly on a polynomial ring, we can find monomial generators for the subring of invariants. By Noether's degree bound and Hilbert's finiteness theorem, we know that there are finitely many…

Given a linear ordinary differential operator T with polynomial coefficients, we study the class of closed subsets of the complex plane such that T sends any polynomial (resp. any polynomial of degree exceeding a given positive integer)…