Related papers: On the complexity of solving linear congruences an…

We prove that the tensor product of a simple and a finite dimensional $\mathfrak{sl}_n$-module has finite type socle. This is applied to reduce classification of simple $\mathfrak{q}(n)$-supermodules to that of simple…

We study incremental knapsack problems with profits given by a special class of monotone submodular functions, that we dub all-or-nothing. We show that these problems are not harder to approximate than a less general class of modular…

Let $\Lambda$ be a basic finite dimensional algebra over an algebraically closed field, presented as a path algebra modulo relations; further, assume that $\Lambda$ is graded by lengths of paths. The paper addresses the classifiability, via…

Given a planar digraph $G$ and a positive even integer $k$, an embedding of $G$ in the plane is k-modal, if every vertex of $G$ is incident to at most $k$ pairs of consecutive edges with opposite orientations, i.e., the incoming and the…

We investigate certain finiteness questions that arise naturally when studying approximations modulo prime powers of p-adic Galois representations coming from modular forms. We link these finiteness statements with a question by K. Buzzard…

We consider the problem of describing all non-negative integer solutions to a linear congruence in many variables. This question may be reduced to solving the congruence $x_1 + 2x_2 + 3x_3 + ... + (n-1)x_{n-1} \equiv 0 \pmod n$ where values…

We consider the following class of submodular k-multiway partitioning problems: (Sub-$k$-MP) $\min \sum_{i=1}^k f(S_i): S_1 \uplus S_2 \uplus \cdots \uplus S_k = V \mbox{ and } S_i \neq \emptyset \mbox{ for all }i\in [k]$. Here $f$ is a…

We define a congruence module $\Psi_A(M)$ associated to a surjective $\mathcal O$-algebra morphism $\lambda\colon A \to \mathcal{O}$, with $\mathcal{O}$ a discrete valuation ring, $A$ a complete noetherian local $\mathcal{O}$-algebra…

We consider the linear complementarity problem with uncertain data modeled by intervals, representing the range of possible values. Many properties of the linear complementarity problem (such as solvability, uniqueness, convexity, finite…

The low-rank matrix completion problem asks whether a given real matrix with missing values can be completed so that the resulting matrix has low rank or is close to a low-rank matrix. The completed matrix is often required to satisfy…

Let $n$ be a positive integer, and let $k$ be a field (of arbitrary characteristic) accessible to symbolic computation. We describe an algorithmic test for determining whether or not a finitely presented $k$-algebra $R$ has infinitely many…

Let $g$ be a semisimple Lie algebra over $\mathbb C$ and $k$ be a reductive in $g$ subalgebra. We say that a simple $g$-module $M$ is a $(g; k)$-module if as a $k$-module $M$ is a direct sum of finite-dimensional $k$-modules. We say that a…

Let $N>1$ be an integer, and let $\Gamma = \Gamma_0 (N) \subset \SL_4 (\Z)$ be the subgroup of matrices with bottom row congruent to $(0,0,0,*)\mod N$. We compute $H^5 (\Gamma; \C) $ for a range of $N$, and compute the action of some Hecke…

We study the problem of solvability of linear differential systems with small coefficients in the Liouvillian sense (or, by generalized quadratures). For a general system, this problem is equivalent to that of solvability of the Lie algebra…

We study a class of noncanonical real scalar field models in $(1+1)$-dimensional flat space-time. We first derive the general criterion for the classical linear stability of an arbitrary static soliton solution of these models. Then we…

We give the first positive formulas for the weights of every simple highest weight module $L(\lambda)$ over an arbitrary Kac-Moody algebra. Under a mild condition on the highest weight, we also express the weights of $L(\lambda)$ as an…

The theory of partition congruences has been a fascinating and difficult subject for over a century now. In attempting to prove a given congruence family, multiple possible complications include the genus of the underlying modular curve,…

In the last three decades, the $k$-SUM hypothesis has emerged as a satisfying explanation of long-standing time barriers for a variety of algorithmic problems. Yet to this day, the literature knows of only few proven consequences of a…

The problem of minimizing the Potts energy function frequently occurs in computer vision applications. One way to tackle this NP-hard problem was proposed by Kovtun [19,20]. It identifies a part of an optimal solution by running $k$ maxflow…

We introduce Koszul modules associated with (graded) Kac-Moody Lie algebras. We provide a precise criterion for when these modules are of finite length. As an exemplary application we deduce a bound on the dimension of the second graded…