Related papers: Computing minimal Gorenstein covers
We provide CONGEST model algorithms for approximating minimum weighted vertex cover and the maximum weighted matching. For bipartite graphs, we show that a $(1+\varepsilon)$-approximate weighted vertex cover can be computed…
This paper proposes and analyzes a class of weak Galerkin (WG) finite element methods for stationary natural convection problems in two and three dimensions. We use piecewise polynomials of degrees k, k-1, and k(k>=1) for the velocity,…
In this paper, we solve the longstanding Gaussian curvature conjecture of a minimal graph $S$ over the unit disk. The conjecture asserts that for any minimal graph above the unit disk, the Gaussian curvature at the point directly above the…
Let f(x) be a monic polynomial in Z[x] with no rational roots but with roots in Q_p for all p, or equivalently, with roots mod n for all n. It is known that f(x) cannot be irreducible but can be a product of two or more irreducible…
We study the structure of the inverse limit of the graded algebras of local unitary invariant polynomials using its Hilbert series. For k subsystems, we conjecture that the inverse limit is a free algebra and the number of algebraically…
Using Macaulay's correspondence we study the family of Artinian Gorenstein local algebras with fixed symmetric Hilbert function decomposition. As an application we give a new lower bound for cactus varieties of the third Veronese embedding.…
We introduce characteristic numbers of a finite commutative unital $\mathbb{C}$-algebra, which are numerical invariants arising from algebraic intersection theory. We characterize Gorenstein and local complete intersection algebras in terms…
Dualities of resolving subcategories of finitely generated modules over Artin algebras are characterized as dualities with respect to Wakamatsu tilting bimodules. By restriction of these dualities to resolving subcategories of finitely…
In this note, we present a systematic method to explicitly compute the determinants and inverses for some generalized Hilbert matrices associated with orthogonal systems with explicit representations. We expressed the determinant, the…
Motivated by a recent result of Yoshino, and the work of Bergh on reducible complexity, we introduce reducing versions of invariants of finitely generated modules over commutative Noetherian local rings. Our main result considers modules…
Let $\KX =K\langle X_1,\ldots ,X_n\rangle$ be the free algebra generated by $X=\{ X_1,\ldots ,X_n\}$ over a field $K$. It is shown that with respect to any weighted $\mathbb{N}$-gradation attached to $\KX$, minimal homogeneous generating…
We consider linear approximation based on function evaluations in reproducing kernel Hilbert spaces of certain analytic weighted power series kernels and stationary kernels on the interval $[-1,1]$. Both classes contain the popular Gaussian…
In this paper, we characterize the dynamic of every abelian subgroups $\mathcal{G}$ of GL($n$, $\mathbb{K}$), $\mathbb{K} = \mathbb{R}$ or $\mathbb{C}$. We show that there exists a $\mathcal{G}$-invariant, dense open set $U$ in…
The question of the existence of a polynomial kernelization of the Vertex Cover Above LP problem has been a longstanding, notorious open problem in Parameterized Complexity. Five years ago, the breakthrough work by Kratsch and Wahlstrom on…
Suppose $X$ is a smooth projective connected curve defined over an algebraically closed field $k$ of characteristic $p>0$ and $B \subset X(k)$ is a finite, possibly empty, set of points. The Newton polygon of a degree $p$ Galois cover of…
In this paper, we present a low-diameter decomposition algorithm in the LOCAL model of distributed computing that succeeds with probability $1 - 1/poly(n)$. Specifically, we show how to compute an $\left(\epsilon, O\left(\frac{\log…
For every natural number k we prove a decomposition theorem for bounded measurable functions on compact abelian groups into a structured part, a quasi random part and a small error term. In this theorem quasi randomness is measured with the…
This paper introduces a new class of algorithms for solving large-scale linear inverse problems based on new flexible and inexact Golub-Kahan factorizations. The proposed methods iteratively compute regularized solutions by approximating a…
We use the construction of the relative bar resolution via differential graded structures to obtain the minimal graded free resolution of $\text{Der}_{R \mid k}$, where $R$ is a determinantal ring defined by the maximal minors of an $n…
A new robust algorithm for the numerical computation of biarcs, i.e. $G^1$ curves composed of two arcs of circle, is presented. Many algorithms exist but are based on geometric constructions, which must consider many geometrical…