Related papers: Light on the Infinite Group Relaxation

This paper initiates a systematic development of a theory of non-commutative optimization. It aims to unify and generalize a growing body of work from the past few years which developed and analyzed algorithms for natural geodesically…

74J30The maximal group of Lie point symmetries of a system of nonlinear equations used in geophysical fluid dynamics is presented. The Lie algebra of this group is infinite-dimensional and involves three arbitrary functions of time. The…

In [21] it was asked if equality on the reals is sharp as a lower bound for the complexity of topological isomorphism between oligomorphic groups. We prove that under the assumption of weak elimination of imaginaries this is indeed the…

Convexification techniques have gained increasing interest over the past decades. In this work, we apply a recently developed convexification technique for fractional programs by He, Liu and Tawarmalani (2024) to the problem of determining…

We critically review the use of the exact renormalization group equations (ERGE) in the framework of the scalar theory. We lay emphasis on the existence of different versions of the ERGE and on an approximation method to solve it: the…

In this paper, we study (noisy) linear systems, and their $\ell_0$-regularized optimization problems, coupled with general data fidelity terms. Recent approaches for solving this class of problems have proposed to consider non-convex exact…

We describe the exponential map from an infinite-dimensional Lie algebra to an infinite-dimensional group of operators on a Hilbert space. Notions of differential geometry are introduced for these groups. In particular, the Ricci curvature,…

This paper is a survey on the works [MS77, MS79, MS81] on maximal subgroups in finitely generated linear groups, and the works that followed it [GG08, GG13b, GG13a, Kap03, Iva92, HO16, GM16, AGS14, Sf90, Sf98, Per05, AKT16, FG18, GS17]…

The inverse problem of Galois Theory was developed in the early 1800 s as an approach to understand polynomials and their roots. The inverse Galois problem states whether any finite group can be realized as a Galois group over Q (field of…

Mixed-integer nonlinear optimization encompasses a broad class of problems that present both theoretical and computational challenges. We propose a new type of method to solve these problems based on a branch-and-bound algorithm with convex…

Non-negative elements in group algebras play a crucial role in the study of functions, measures and operators. This paper focuses on the sum of Hermitian squares (SOHS) of non-negative elements in group algebras of finite groups. We first…

The Hermitian eigenvalue problem asks for the possible eigenvalues of a sum of Hermitian matrices given the eigenvalues of the summands. This is a problem about the Lie algebra of the maximal compact subgroup of $G=\operatorname{SL}(n)$ .…

Extremal Combinatorics is among the most active topics in Discrete Mathematics, dealing with problems that are often motivated by questions in other areas, including Theoretical Computer Science and Information Theory. This paper contains a…

This paper presents the first study of the complexity of the optimization problem for integer linear-exponential programs which extend classical integer linear programs with the exponential function $x \mapsto 2^x$ and the remainder…

Many isomorphism problems for tensors, groups, algebras, and polynomials were recently shown to be equivalent to one another under polynomial-time reductions, prompting the introduction of the complexity class TI (Grochow & Qiao, ITCS '21;…

This is a preliminary version of a book on infinite-dimensional Lie groups. It covers the basics of calculus and manifolds in the context of locally convex spaces, based on Bastiani's notion of a smooth map. Starting from this concept, we…

Exploring the power of linear programming for combinatorial optimization problems has been recently receiving renewed attention after a series of breakthrough impossibility results. From an algorithmic perspective, the related questions…

We introduce geometric consideration into the theory of formal languages. We aim to shed light on our understanding of global patterns that occur on infinite strings. We utilise methods of geometric group theory. Our emphasis is on large…

We propose the first general and practical framework to design certifiable algorithms for robust geometric perception in the presence of a large amount of outliers. We investigate the use of a truncated least squares (TLS) cost function,…

Motivated by the theory of graph limits, we introduce and study the convergence and limits of linear representations of finite groups over finite fields. The limit objects are infinite dimensional representations of free groups in…