Related papers: The Modular Isomorphism Problem for small groups -…

We consider integer programming problems with bounded general-integer variables belonging to the general class of network flow problems. For those, we computationally investigate the effect on mixed-integer linear programming (MIP) solvers…

A module $M$ is called an automorphism-invariant module if every isomorphism between two essential submodules of $M$ extends to an automorphism of $M$. This paper introduces the notion of dual of such modules. We call a module $M$ to be a…

Let $K_\infty/K$ be a uniform $p$-adic Lie extension. We compare several arithmetic invariants of Iwasawa modules of ideal class groups on the one side and fine Selmer groups of abelian varieties on the other side. If $K_\infty$ contains…

The paper is concerned with locally stabilized space-time IgA approximations to initial boundary value problems of the parabolic type. Originally, similar schemes (but weighted with a global mesh parameter) was presented and studied by U.…

Let K be a field of positive characteristic p, let R be either a group algebra K[G] or a restricted enveloping algebra u(L), and let I be the augmentation ideal of R. We first characterize those R for which I satisfies a polynomial identity…

We present an ideal mixed-integer programming (MIP) formulation for a rectified linear unit (ReLU) appearing in a trained neural network. Our formulation requires a single binary variable and no additional continuous variables beyond the…

As a generalization of the modular isomorphism problem we study the behavior of defect groups under Morita equivalence of blocks of finite groups over algebraically closed fields of positive characteristic. We prove that the Morita…

Let $R=k[x_1,\dots,x_n]$ be a ring of polynomials over a field $k$ of characteristic $p>0$. There is an algorithm due to Lyubeznik for deciding the vanishing of local cohomology modules $H^i_I(R)$ where $I\subset R$ is an ideal. This…

We study a variant of the \emph{generalized assignment problem} ({\sf GAP}) with group constraints. An instance of {\sf Group GAP} is a set $I$ of items, partitioned into $L$ groups, and a set of $m$ uniform (unit-sized) bins. Each item $i…

Invariant functions under the transformations of a compact linear group $G$ acting in $\real^n$ can be expressed in terms of functions defined in the orbit space of $G$. We develop a method to determine the isotropy classes of the orbit…

We present a procedure to solve the inverse Ising problem, that is to find the interactions between a set of binary variables from the measure of their equilibrium correlations. The method consists in constructing and selecting specific…

We propose a prototypical Split Inverse Problem (SIP) and a new variational problem, called the Split Variational Inequality Problem (SVIP), which is a SIP. It entails finding a solution of one inverse problem (e.g., a Variational…

Given a quantum permutation group $G\subset S_N^+$, with orbits having the same size $K$, we construct a universal matrix model $\pi:C(G)\to M_K(C(X))$, having the property that the images of the standard coordinates $u_{ij}\in C(G)$ are…

Given an ideal $I$ we investigate the decompositions of Betti diagrams of the graded family of ideals $\{I^k \}_k$ formed by taking powers of $I$. We prove conjectures of Engstr\"om and show that there is a stabilization in the…

The goal in {\em reconfiguration problems} is to compute a {\em gradual transformation} between two feasible solutions of a problem such that all intermediate solutions are also feasible. In the {\em Matching Reconfiguration Problem} (MRP),…

The submodular function maximization is an attractive optimization model that appears in many real applications. Although a variety of greedy algorithms quickly find good feasible solutions for many instances while guaranteeing…

Several recent publications report advances in training optimal decision trees (ODT) using mixed-integer programs (MIP), due to algorithmic advances in integer programming and a growing interest in addressing the inherent suboptimality of…

The inductive matrix completion (IMC) problem is to recover a low rank matrix from few observed entries while incorporating prior knowledge about its row and column subspaces. In this work, we make three contributions to the IMC problem:…

This article presents a class of modified new modulus-based iterative methods to process the large and sparse implicit complementarity problem (ICP). By using two positive diagonal matrices, we formulate a fixed-point equation which is…

We approach the hidden subgroup problem by performing the so-called pretty good measurement on hidden subgroup states. For various groups that can be expressed as the semidirect product of an abelian group and a cyclic group, we show that…