Related papers: Algorithms for Checking Zero-Dimensional Complete …
It is shown that, given any finite dimensional, split basic algebra $\Lambda = K\Gamma/I$ (where $\Gamma$ is a quiver and $I$ an admissible ideal in the path algebra $K \Gamma$), there is a finite list of affine algebraic varieties, the…
Set intersection is a fundamental operation in information retrieval and database systems. This paper introduces linear space data structures to represent sets such that their intersection can be computed in a worst-case efficient way. In…
The numerical properties of algorithms for finding the intersection of sets depend to some extent on the regularity of the sets, but even more importantly on the regularity of the intersection. The alternating projection algorithm of von…
Given an edge-colored complete graph $K_n$ on $n$ vertices, a perfect (respectively, near-perfect) matching $M$ in $K_n$ with an even (respectively, odd) number of vertices is rainbow if all edges have distinct colors. In this paper, we…
We produce algorithms to detect whether a complex affine variety computed and presented numerically by the machinery of numerical algebraic geometry corresponds to an associated component of a polynomial ideal.
Using group actions and orbit-stabilizer methods, we study the geometry of isomorphism classes of finite-dimensional $\omega$-Lie algebras over a field $\mathbb{K}$ of characteristic $\neq 2$ and establish a one-to-one correspondence…
We study moduli spaces of a class of three dimensional N=4 gauge theories which are in one-to-one correspondence with a certain set of ordered pairs of integer partitions. It was found that these theories can be realised on brane intervals…
We determine sets of elements which, under certain conditions, generate an intersection of ideals up to radical.
In this paper we continue the development of a new technique for computing elimination ideals by substitution which has been called $Z$-separating re-embeddings. Given an ideal $I$ in the polynomial ring $K[x_1,\dots,x_n]$ over a field $K$,…
The Maximum Induced Matching problem asks to find the maximum $k$ such that, given a graph $G=(V,E)$, can we find a subset of vertices $S$ of size $k$ for which every vertices $v$ in the induced graph $G[S]$ has exactly degree $1$. In this…
The Exact Matching (EM) problem asks whether there exists a perfect matching which uses a prescribed number of red edges in a red/blue edge-colored graph. While there exists a randomized polynomial-time algorithm for the problem, only some…
We let R be a one-dimensional graded complete intersection, satisfying certain degree conditions which are satisfied whenever R is a numerical semigroup ring of embedding dimension at least three. We show that a graded maximal…
We consider the following generalization of the seminal Erd\H{o}s-Ko-Rado theorem, due to Frankl. For k>= 2, let F be a k-wise intersecting family of r-subsets of an n element set X, i.e. any k sets in F have a nonempty intersection. If r<=…
We study the representation dimension of the class of algebras known as quantum complete intersections. For such an algebra, we show that the representation dimension is at most twice its codimension. Moreover, we show that the…
Consider the rational map $\phi: \mathbb{P}^{n-1}_{\mathbf k} \stackrel{[f_0:\cdots: f_n]}{\longrightarrow} \mathbb{P}^{n}_{\mathbf k}$ defined by homogeneous polynomials $f_0,\dots,f_n$ of the same degree $d$ in a polynomial ring…
We study the local symplectic algebra of the 0-dimensional isolated complete intersection singularities. We use the method of algebraic restrictions to classify these symplectic singularities. We show that there are non-trivial symplectic…
A family of subsets $\mathcal{F}\subseteq {[n]\choose k}$ is called intersecting if any two of its members share a common element. Consider an intersecting family, a direct problem is to determine its maximal size and the inverse problem is…
Let K denote an algebraically closed field. We study the relation between an ideal I in K[x1,...,xn] and its cross sections I_a=I+<x1-a>. In particular, we study under what conditions I can be recovered from the set I_S={(a,I_a):a in S}…
We study almost complete intersections ideals whose Rees algebras are extremal in the sense that some of their fundamental metrics---depth or relation type---have maximal or minimal values in the class. The focus is on those ideals that…
Given non-negative weights w_S on the k-subsets S of a km-element set V, we consider the sum of the products w_{S_1} ... w_{S_m} for all partitions V = S_1 cup ... cup S_m into pairwise disjoint k-subsets S_i. When the weights w_S are…