Related papers: On Minimum CADs for Algebraic Sets in Dimension Th…
A graph is chordal if every cycle of length at least four contains a chord, that is, an edge connecting two nonconsecutive vertices of the cycle. Several classical applications in sparse linear systems, database management, computer vision,…
Submodular functions describe a variety of discrete problems in machine learning, signal processing, and computer vision. However, minimizing submodular functions poses a number of algorithmic challenges. Recent work introduced an…
Given a finite group $G$ and positive integers $r$ and $s$, a problem of interest in algebra is determining the minimum cardinality of the product set $AB$, where $A$ and $B$ are subsets of $G$ such that $|A|=r$ and $|B|=s$. This problem…
We present an algorithm which produces a decomposition of a regular cellular complex with a discrete Morse function analogous to the Morse-Smale decomposition of a smooth manifold with respect to a smooth Morse function. The advantage of…
A very interesting problem in the classical theory of minimal surfaces consists of the classification of such surfaces under some geometrical and topological constraints. In this short paper, we give a brief summary of the known…
Subregular W-algebras are an interesting and increasingly important class of quantum hamiltonian reductions of affine vertex algebras. Here, we show that the $\mathfrak{sl}_{n+1}$ subregular W-algebra can be realised in terms of the…
We consider real forms of relatively minimal rational surfaces F_m. Connected components of moduli of real non-singular curves in |-2K_{F_m}| had been classified recently for m=0, 1, 4 in math.AG/0312396. Applying similar methods, here we…
Delorme suggested that the set of all complete intersection numerical semigroups can be computed recursively. We have implemented this algorithm, and particularized it to several subfamilies of this class of numerical semigroups: free and…
A method is described which identifies a wide variety of AF algebra dimension groups with groups of continuous functions. Since the continuous functions in these groups have domains which correspond to the set of all infinite paths in what…
Many data analysis applications deal with large matrices and involve approximating the matrix using a small number of ``components.'' Typically, these components are linear combinations of the rows and columns of the matrix, and are thus…
Seymour's decomposition theorem for regular matroids is a fundamental result with a number of combinatorial and algorithmic applications. In this work we demonstrate how this theorem can be used in the design of parameterized algorithms on…
This paper focuses on the derivations and automorphism groups of certain finite-dimensional associative algebras over the field of complex numbers. Using classification results for algebras of dimensions two, three, and four, along with…
An effective upper bound is established for the least non-trivial integer solution to the system of cubic forms \[ \begin{cases} F = c_{1}x_1^3 + c_{2}x_2^3 + \cdots + c_{n}x_n^3 = 0, \\ G = d_{1}x_1^3 + d_{2}x_2^3 + \cdots + d_{n}x_n^3 =…
It is shown that every Jiang-Su stable approximately subhomogeneous C*-algebra has finite decomposition rank. Previously, it was not even known that such algebras have finite nuclear dimension. A key step in the proof is that subhomogeneous…
We initiate and study the theory of ``real decomposable maps" between real operator systems. Formally, this is new even in the complex case, which hitherto has restricted itself to the case where the systems are complex C*-algebras. We…
The Minimum Path Cover (MPC) problem consists of finding a minimum-cardinality set of node-disjoint paths that cover all nodes in a given graph. We explore a variant of the MPC problem on acyclic digraphs (DAGs) where, given a subset of…
We obtain minimal dimension matrix representations for each indecomposable five-dimensional Lie algebra over $\R$ and justify in each case that they are minimal. In each case a matrix Lie group is given whose matrix Lie algebra provides the…
By means of parametrized presentations of finite metabelian 3-groups, it is proved that the coclass cc(M) of the second 3-class group M=Gal(F_3^2(K)/K) of any algebraic number field K with elementary bicyclic 3-class group Cl_3(K)=(3,3) is…
An ordered set $S$ of vertices of a graph $G$ is a resolving set for $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The metric dimension of G is the minimum cardinality of a resolving set. In…
Context: Detecting arrays are mathematical structures aimed at fault identification in combinatorial interaction testing. However, they cannot be directly applied to systems that have constraints among test parameters. Such constraints are…