Related papers: Characterization of the Split Closure via Geometri…

We investigate how the numerical properties of the LP relaxations evolve throughout the solution procedure in a solver employing the branch-and-cut algorithm. The long-term goal of this work is to determine whether the effect on the…

In [2], an exhaustive construction is achieved for the class of all 4-dimensional unital division algebras over finite fields of odd order, whose left nucleus is not minimal and whose automorphism group contains Klein's four-group. We…

Cutting plane methods are a fundamental approach for solving integer linear programs (ILPs). In each iteration of such methods, additional linear constraints (cuts) are introduced to the constraint set with the aim of excluding the previous…

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…

Multilevel partitioning methods that are inspired by principles of multiscaling are the most powerful practical hypergraph partitioning solvers. Hypergraph partitioning has many applications in disciplines ranging from scientific computing…

Comparing the module categories of an algebra and of the endomorphism algebra of a given support $\tau$-tilting module, we give a generalization of the Brenner-Butler's tilting theorem in the framework of $\tau$-tilting theory. Afterwards…

We study systems of quadratic forms over fields and their isotropy over 2-extensions. We apply this to obtain particular splitting fields for quaternion algebras defined over a finite field extension. As a consequence, we obtain that every…

We prove super-polynomial lower bounds on the size of linear programming relaxations for approximation versions of constraint satisfaction problems. We show that for these problems, polynomial-sized linear programs are exactly as powerful…

We introduce the notion of "quasi-symmetric" polynomials, which is a generalization of the notion of symmetry, and is particularly suited to the setting of polynomial rings over finite fields. The properties of this new class of functions…

We quantify the topological expansion properties of bounded degree simplicial complexes in terms of a family of sublinear functions, in analogy with the separation profile of Benjamini-Schramm-Tim\'ar for classical expansion of bounded…

Kricker defined an invariant of knots in homology 3-spheres which is a rational lift of the Kontsevich integral, and proved with Garoufalidis that this invariant satisfies splitting formulas with respect to a surgery move called null-move.…

In an earlier work, the first author and Petsche solved an energy minimization problem for local fields and used the result to obtain lower bounds on the height of algebraic numbers all whose conjugates lie in various local fields, such as…

We present in this paper two different classes of general $K$-splitting algorithms for solving finite-dimensional convex optimization problems. Under the assumption that the function being minimized has a Lipschitz continuous gradient, we…

We introduce the notion of halfspaces associated to a group splitting, and investigate the relationship between the coarse geometry of the halfspaces and the coarse geometry of the group. Roughly speaking, the halfspaces of a group…

We assume some standard choices for the branch cuts of a group of functions and consider the problem of then calculating the branch cuts of expressions involving those functions. Typical examples include the addition formulae for inverse…

Normalized-cut graph partitioning aims to divide the set of nodes in a graph into $k$ disjoint clusters to minimize the fraction of the total edges between any cluster and all other clusters. In this paper, we consider a fair variant of the…

The generalized intersection cut (GIC) paradigm is a recent framework for generating cutting planes in mixed integer programming with attractive theoretical properties. We investigate this computationally unexplored paradigm and observe…

Let A and B be two connected graded commutative k-algebras of finite type, where k is a perfect field of positive characteristic p. We prove that the quasi--shuffle algebras generated by A and B are isomorphic as Hopf algebras if and only…

We introduce a notion of distributional $k$-forms on $d$-dimensional manifolds which can be integrated against suitably regular $k$-submanifolds. Our approach combines ideas from Whitney's geometric integration [Whi57] with those of sewing…

Let R=K[M] be a normal affine monoid algbera over a field K.Up to isomorphism the conic ideals are exactly the direct summands ofthe extension R^{1/n} of R. We show that the classes of the conic divisorial ideals can be identified with the…