Related papers: The Modular Isomorphism Problem for small groups -…
This paper analyses the feasible sets structure of general mixed integer linear programs (MIPs) and its relationship with the existence of a finite cardinality test set which can be applied in augmentation algorithms. We derive and…
Given two CM elliptic curves over a number field and a natural number $m$, we establish a polynomial lower bound (in terms of $m$) for the number of rational primes $p$ such that the reductions of these elliptic curves modulo a prime above…
We study convolution semigroups of invariant/finitely satisfiable Keisler measures in NIP groups. We show that the ideal (Ellis) subgroups are always trivial and describe minimal left ideals in the definably amenable case, demonstrating…
We identify all small groups of order up to 288 in the GAP Library for which the Zassenhaus conjecture on rational conjugacy of units of finite order in the integral group ring cannot be established by an existing method. The groups must…
We consider the polynomial Ideal Membership Problem (IMP) for ideals encoding combinatorial problems that are instances of CSPs over a finite language. In this paper, the input polynomial $f$ has degree at most $d=O(1)$ (we call this…
We prove a rigidity result for automorphisms of points of certain stacks admitting adequate moduli spaces. It encompasses as special cases variations of the moduli of $G$-bundles on a smooth projective curve for a reductive algebraic group…
Let G be a compact p-adic analytic group. We study K-theoretic questions related to the representation theory of the completed group algebra kG of G with coefficients in a finite field k of characteristic p. We show that if M is a finitely…
Cutting planes for mixed-integer linear programs (MILPs) are typically computed in rounds by iteratively solving optimization problems, the so-called separation. Instead, we reframe the problem of finding good cutting planes as a continuous…
We initiate a systematic study of the convolution operation on Keisler measures, generalizing the work of Newelski in the case of types. Adapting results of Glicksberg, we show that the supports of generically stable (or just definable,…
In this paper we investigate the parallelization of two modular algorithms. In fact, we consider the modular computation of Gr\"obner bases (resp. standard bases) and the modular computation of the associated primes of a zero-dimensional…
The problem of developing an adaptive isogeometric method (AIGM) for solving elliptic second-order partial differential equations with truncated hierarchical B-splines of arbitrary degree and different order of continuity is addressed. The…
We generalise Gabidulin codes to the case of infinite fields, eventually with characteristic zero. For this purpose, we consider an abstract field extension and any automorphism in the Galois group. We derive some conditions on the…
The Isomorphism Conjecture is a conceptional approach towards a calculation of the algebraic K-theory of a group ring RG, where G is an infinite group. In this paper we prove the conjecture in dimensions n<2 for fundamental groups of closed…
In this paper, we study the generalized problem that minimizes or maximizes a multi-order complex quadratic form with constant-modulus constraints on all elements of its optimization variable. Such a mathematical problem is commonly…
Lagrangian duality in mixed integer optimization is a useful framework for problems decomposition and for producing tight lower bounds to the optimal objective, but in contrast to the convex counterpart, it is generally unable to produce…
Imitation learning (IL) provides a data-driven framework for approximating policies for large-scale combinatorial optimisation problems formulated as sequential decision problems (SDPs), where exact solution methods are computationally…
We study the statistical estimation problem of orthogonal group synchronization and rotation group synchronization. The model is $Y_{ij} = Z_i^* Z_j^{*T} + \sigma W_{ij}\in\mathbb{R}^{d\times d}$ where $W_{ij}$ is a Gaussian random matrix…
In this paper, we propose a probabilistic optimization method, named probabilistic incremental proximal gradient (PIPG) method, by developing a probabilistic interpretation of the incremental proximal gradient algorithm. We explicitly model…
Let $p$ be an odd prime and $L/K$ a $p$-adic Lie extension whose Galois group is of the form $\mathbb{Z}_p^{d-1}\rtimes \mathbb{Z}_p$. Under certain assumptions on the ramification of $p$ and the structure of an Iwasawa module associated to…
For a unital ring $S$, an $S$-linear quasigroup is a unital $S$-module, with automorphisms $\rho$ and $\lambda$ giving a (nonassociative) multiplication $x\cdot y=x^\rho+y^\lambda$. If $S$ is the field of complex numbers, then ordinary…