Related papers: An Algorithm to compute the Kronecker cone and oth…
We provide counter-examples to Mulmuley's strong saturation conjecture (strong SH) for the Kronecker coefficients. This conjecture was proposed in the setting of Geometric Complexity Theory to show that deciding whether or not a Kronecker…
Nonnegative matrix factorization is the following problem: given a nonnegative input matrix $V$ and a factorization rank $K$, compute two nonnegative matrices, $W$ with $K$ columns and $H$ with $K$ rows, such that $WH$ approximates $V$ as…
Let N be the set of non-negative integer numbers, T the circle group and c the cardinality of the continuum. Given an abelian group G of size at most 2^c and a countable family F of infinite subsets of G, we construct "Baire many"…
The numerical performance of algorithms can be studied using test sets or procedures that generate such problems. This paper proposes various methods for generating linear, semidefinite, and second-order cone optimization problems.…
The recent analysis on noncommutative geometry, showing quantization of the volume for the Riemannian manifold entering the geometry, can support a view of quantum mechanics as arising by a stochastic process on it. A class of stochastic…
Cone regression is a particular case of quadratic programming that minimizes a weighted sum of squared residuals under a set of linear inequality constraints. Several important statistical problems such as isotonic, concave regression or…
We show that the problem of deciding positivity of Kronecker coefficients is NP-hard. Previously, this problem was conjectured to be in P, just as for the Littlewood-Richardson coefficients. Our result establishes in a formal way that…
In this paper we study the general minimization vector problem (P), concerning a perturbation mapping, defined in locally convex Hausdorff topological vector spaces where the "WInf" stands for the weak infimum with respect to an ordering…
We show that sufficiently low tensor rank for the balanced tripartitioning tensor $P_d(x,y,z)=\sum_{A,B,C\in\binom{[3d]}{d}:A\cup B\cup C=[3d]}x_Ay_Bz_C$ for a large enough constant $d$ implies uniform arithmetic circuits for the matrix…
We consider the classical Minimum Balanced Cut problem: given a graph $G$, compute a partition of its vertices into two subsets of roughly equal volume, while minimizing the number of edges connecting the subsets. We present the first {\em…
Consider an $n\times k$ matrix of i.i.d. Bernoulli random numbers with $p=1/2$. Dual RSK algorithm gives a bijection of this matrix to a pair of Young tableaux of conjugate shape, which is manifestation of skew Howe $GL_{n}\times…
In the theory of algebraic groups, parabolic subgroups form a crucial building block in the structural studies. In the case of general linear groups over a finite field $F_q$, given a sequence of positive integers $n_1, ..., n_k$, where…
We reformulate the problem of modularity maximization over the set of partitions of a network as a conic optimization problem over the completely positive cone, converting it from a combinatorial optimization problem to a convex continuous…
In this article, we propose an algorithm for approximating the action of $\varphi-$functions of matrices against vectors, which is a key operation in exponential time integrators. In particular, we consider matrices with Kronecker sum…
E.B. Vinberg developed a theory of homogeneous convex cones $C \subset V= \mathbb{R}^n$, which has many applications. He gave a construction of such cones in terms of non-associative rank $n$ matrix T-algebras $\cal{T}$, that consist of…
The family of graphs that can be constructed from isolated vertices by disjoint union and graph join operations are called cographs. These graphs can be represented in a tree-like representation termed parse tree or cotree. In this paper,…
A fundamental problem from invariant theory is to describe the endomorphism algebra of multilinear functions on a representation V invariant under the action of a group G. According to Weyl's classic, a first main (later: fundamental)…
The Gruenberg-Kegel graph of a group is the undirected graph whose vertices are those primes which occur as the order of an element of the group, and distinct vertices $p$, $q$ are joined by an edge whenever the group has an element of…
In comparison to graphs, combinatorial methods for the isomorphism problem of finite groups are less developed than algebraic ones. To be able to investigate the descriptive complexity of finite groups and the group isomorphism problem, we…
In this article, we establish some new combinatorial properties of cone types in Coxeter groups. Firstly, we show that for any element $x$ in a Coxeter group $W$ and root $\beta$ in its inversion set $\Phi(x)$, the set of elements $y \in W$…