Related papers: Optimizing Extension Techniques for Discovering No…
We introduce a new algebraic topological technique to detect non-fibred knots in the three sphere using the twisted Alexander invariants. As an application, we show that for any Seifert matrix of a knot with a nontrivial Alexander…
We determine the border subrank of higher order structure tensors of several families of algebras, and in particular obtain the following results. (1) We determine tight bounds on the border subrank of $k$-fold matrix multiplication and…
Slater introduced the point-addition operation on graphs to classify 4-connected graphs. The $\Gamma$-extension operation on binary matroids is a generalization of the point-addition operation. In this paper, we obtain necessary and…
The dressing procedure for the Generalised Zakharov--Shabat system is well known for systems, related to sl(N) algebras. We extend the method, constructing explicitly the dressing factors for some systems, related to orthogonal and…
This paper is devoted to developing the alternating minimization algorithm for problems of structured nonconvex optimization proposed by Attouch, Bolt\'e, Redont, and Soubeyran in 2010. Our main result provides significant improvements of…
We propose a new unsupervised and non-parametric method to detect change points in intricate quasi-periodic signals. The detection relies on optimal transport theory combined with topological analysis and the bootstrap procedure. The…
Asymmetric data naturally exist in real life, such as directed graphs. Different from the common kernel methods requiring Mercer kernels, this paper tackles the asymmetric kernel-based learning problem. We describe a nonlinear extension of…
While the basic greedy algorithm gives a semi-streaming algorithm with an approximation guarantee of $2$ for the \emph{unweighted} matching problem, it was only recently that Paz and Schwartzman obtained an analogous result for weighted…
The randomized extended Kaczmarz method, proposed by Zouzias and Freris (SIAM J. Matrix Anal. Appl. 34: 773-793, 2013), is appealing for solving least-squares problems. However, its randomly selecting rows and columns of A with probability…
We show that various combinatorial invariants of matroids such as Chow rings and Orlik--Solomon algebras may be assembled into "operad-like" structures. Specifically, one obtains several operads over a certain Feynman category which we…
We study the $K$-ring of the wonderful variety of a hyperplane arrangement and give a combinatorial presentation that depends only on the underlying matroid. We use this combinatorial presentation to define the $K$-ring of an arbitrary…
The notion of degree-constrained spanning hierarchies, also called k-trails, was recently introduced in the context of network routing problems. They describe graphs that are homomorphic images of connected graphs of degree at most k. First…
In this work, we study the problem of monotone non-submodular maximization with partition matroid constraint. Although a generalization of this problem has been studied in literature, our work focuses on leveraging properties of partition…
This paper investigates the extension complexity of polytopes by exploiting the correspondence between non-negative factorizations of slack matrices and randomized communication protocols. We introduce a geometric characterization of…
Out-of-distribution detection is an important component of reliable ML systems. Prior literature has proposed various methods (e.g., MSP (Hendrycks & Gimpel, 2017), ODIN (Liang et al., 2018), Mahalanobis (Lee et al., 2018)), claiming they…
In this paper we introduce the semi-graded rings, which extend graded rings and skew PBW extensions. For this new type of non-commutative rings we will discuss some basic problems of non-commutative algebraic geometry. In particular, we…
The present work provides a comprehensive study of symmetric-conjugate operator splitting methods in the context of linear parabolic problems and demonstrates their additional benefits compared to symmetric splitting methods. Relevant…
Neighborly polytopes are those that maximize the number of faces in each dimension among all polytopes with the same number of vertices. Despite their extremal properties they form a surprisingly rich class of polytopes, which has been…
We present a method for nonlinear parametric optimization based on algebraic geometry. The problem to be studied, which arises in optimal control, is to minimize a polynomial function with parameters subject to semialgebraic constraints.…
We revisit the asymptotic analysis of probabilistic construction of adjacency matrices of expander graphs proposed in [4]. With better bounds we derived a new reduced sample complexity for the number of nonzeros per column of these…