arXiv subjects

Martin Kreuzer

Publications and source records attributed to Martin Kreuzer.

36 records · Page 2Linked to original sources

arXiv2021

Cotangent spaces and separating re-embeddings

Given an affine algebra $R=P/I$, where $P=K[x_1,\dots,x_n]$ is a polynomial ring over a field $K$ and $I$ is an ideal in $P$, we study re-embeddings of the affine scheme ${\rm Spec}(R)$, i.e., presentations $R \cong P'/I'$ such that $P'$ is a polynomial ring in fewer indeterminates. To find such re-embeddings, we use polynomials $f_i$ in the ideal $I$ which are coherently separating in the sense that they are of the form $f_i= z_i - g_i$ with an indeterminate $z_i$ which divides neither a term in the support of $g_i$ nor in the support of $f_j$ for $j\ne i$. The possible numbers of such sets of polynomials are shown to be governed by the Gröbner fan of $I$. The dimension of the cotangent space of $R$ at a $K$-linear maximal ideal is a lower bound for the embedding dimension, and if we find coherently separating polynomials corresponding to this bound, we know that we have determined the embedding dimension of $R$ and found an optimal re-embedding.

math.AC↗

arXiv2020

Computing subschemes of the border basis scheme

A good way of parametrizing 0-dimensional schemes in an affine space $\mathbb{A}_K^n$ has been developed in the last 20 years using border basis schemes. Given a multiplicity $μ$, they provide an open covering of the Hilbert scheme ${\rm Hilb}^μ(\mathbb{A}^n_K)$ and can be described by easily computable quadratic equations. A natural question arises on how to determine loci which are contained in border basis schemes and whose rational points represent 0-dimensional $K$-algebras sharing a given property. The main focus of this paper is on giving effective answers to this general problem. The properties considered here are the locally Gorenstein, strict Gorenstein, strict complete intersection, Cayley-Bacharach, and strict Cayley-Bacharach properties. The key characteristic of our approach is that we describe these loci by exhibiting explicit algorithms to compute their defining ideals. All results are illustrated by non-trivial, concrete examples.

math.AC↗

arXiv2020

Hilbert Polynomials of Kähler Differential Modules for Fat Point Schemes

Given a fat point scheme $\mathbb{W}=m_1P_1+\cdots+m_sP_s$ in the projective $n$-space $\mathbb{P}^n$ over a field $K$ of characteristic zero, the modules of Kähler differential $k$-forms of its homogeneous coordinate ring contain useful information about algebraic and geometric properties of $\mathbb{W}$ when $k\in\{1,\dots, n+1\}$. In this paper we determine the value of its Hilbert polynomial explicitly for the case $k=n+1$, confirming an earlier conjecture. More precisely this value is given by the multiplicity of the fat point scheme $\mathbb{Y} = (m_1-1)P_1 + \cdots + (m_s-1)P_s$. For $n=2$, this allows us to determine the Hilbert polynomials of the modules of Kähler differential $k$-forms for $k=1,2,3$, and to produce a sharp bound for the regularity index for $k=2$.

math.AG↗

arXiv2020

A fault attack on the Niederreiter cryptosystem using binary irreducible Goppa codes

A fault injection framework for the decryption algorithm of the Niederreiter public-key cryptosystem using binary irreducible Goppa codes and classical decoding techniques is described. In particular, we obtain low-degree polynomial equations in parts of the secret key. For the resulting system of polynomial equations, we present an efficient solving strategy and show how to extend certain solutions to alternative secret keys. We also provide estimates for the expected number of required fault injections, apply the framework to state-of-the-art security levels, and propose countermeasures against this type of fault attack.

cs.IT↗

arXiv2019

Algorithms for Checking Zero-Dimensional Complete Intersections

Given a 0-dimensional affine K-algebra R=K[x_1,...,x_n]/I, where I is an ideal in a polynomial ring K[x_1,...,x_n] over a field K, or, equivalently, given a 0-dimensional affine scheme, we construct effective algorithms for checking whether R is a complete intersection at a maximal ideal, whether R is locally a complete intersection, and whether R is a strict complete intersection. These algorithms are based on Wiebe's characterisation of 0-dimensional local complete intersections via the 0-th Fitting ideal of the maximal ideal. They allow us to detect which generators of I form a regular sequence resp. a strict regular sequence, and they work over an arbitrary base field K. Using degree filtered border bases, we can detect strict complete intersections in certain families of 0-dimensional ideals.

math.AC↗

arXiv2019

An application of Liaison theory to zero-dimensional schemes

Given a 0-dimensional scheme X in a n-dimensional projective space P^n_K over an arbitrary field K, we use Liaison theory to characterize the Cayley-Bacharach property of X. Our result extends the result for sets of K-rational points given in [7]. In addition, we examine and bound the Hilbert function and regularity index of the Dedekind different of X when X has the Cayley-Bacharach property.

math.AC↗

arXiv2018

On the Cayley-Bacharach Property

The Cayley-Bacharach property, which has been classically stated as a property of a finite set of points in an affine or projective space, is extended to arbitrary 0-dimensional affine algebras over arbitrary base fields. We present characterizations and explicit algorithms for checking the Cayley-Bacharach property directly, via the canonical module, and in combination with the property of being a locally Gorenstein ring. Moreover, we characterize strict Gorenstein rings by the Cayley-Bacharach property and the symmetry of their affine Hilbert function, as well as by the strict Cayley-Bacharach property and the last difference of their affine Hilbert function.

math.AC↗

arXiv2018

Kaehler differentials for fat point schemes in P^1xP^1

Let $X$ be a set of $K$-rational points in $P^1 \times P^1$ over a field $K$ of characteristic zero, let $Y$ be a fat point scheme supported at $ X$, and let $R_Y$ be the bihomogeneus coordinate ring of $Y$. In this paper we investigate the module of Kaehler differentials $Ω^1_{R_Y/K}$. We describe this bigraded $R_Y$-module explicitly via a homogeneous short exact sequence and compute its Hilbert function in a number of special cases, in particular when the support $X$ is a complete intersection or an almost complete intersection in $P^1 \times P^1$. Moreover, we introduce a Kaehler different for $Y$ and use it to characterize reduced fat point schemes in $P^1 \times P^1$ having the Cayley-Bacharach property.

math.AG↗

arXiv2017

Computing all border bases for ideals of points

In this paper we consider the problem of computing all possible order ideals and also sets connected to 1, and the corresponding border bases, for the vanishing ideal of a given finite set of points. In this context two different approaches are discussed: based on the Buchberger-Möller Algorithm, we first propose a new algorithm to compute all possible order ideals and the corresponding border bases for an ideal of points. The second approach involves adapting the Farr-Gao Algorithm for finding all sets connected to 1, as well as the corresponding border bases, for an ideal of points. It should be noted that our algorithms are term ordering free. Therefore they can compute successfully all border bases for an ideal of points. Both proposed algorithms have been implemented and their efficiency is discussed via a set of benchmarks.

math.AC↗

arXiv2017

On the Dedekind different of a Cayley-Bacharach scheme

Given a 0-dimensional scheme $\mathbb{X}$ in a projective space $\mathbb{P}^n_K$ over a field $K$, we characterize the Cayley-Bacharach property of $\mathbb{X}$ in terms of the algebraic structure of the Dedekind different of its homogeneous coordinate ring. Moreover, we characterize Cayley-Bacharach schemes by Dedekind's formula for the conductor and the complementary module, we study schemes with minimal Dedekind different using the trace of the complementary module, and we prove various results about almost Gorenstein and nearly Gorenstein schemes.

math.AG↗

arXiv2017

Kähler differential algebras for 0-dimensional schemes

Given a 0-dimensional scheme in a projective space $\mathbb{P}^n$ over a field $K$, we study the Kähler differential algebra $Ω_{R/K}$ of its homogeneous coordinate ring $R$. Using explicit presentations of the modules $Ω^m_{R/K}$ of Kähler differential $m$-forms, we determine many values of their Hilbert functions explicitly and bound their Hilbert polynomials and regularity indices. Detailed results are obtained for subschemes of $\mathbb{P}^1$, fat point schemes, and subschemes of $\mathbb{P}^2$ supported on a conic.

math.AC↗

arXiv2015

Optical and mechanical properties of nanofibrillated cellulose: towards a robust platform for next-generation green technologies

Nanofibrillated cellulose, a polymer that can be obtained from one of the most abundant biopolymers in Nature, is being increasingly explored due to its outstanding properties for packaging and device applications. Still, open challenges in engineering its intrinsic properties remain to address. The results obtained show the precise determination of significant properties as elastic properties and interactions that are compared with similar works and, moreover, demonstrate that nanofibrillated cellulose properties can be reversibly controlled, supporting the extended potential of nanofibrillated cellulose as a robust platform for green-technology applications

cond-mat.mtrl-sci↗

arXiv2014

Learning with Cross-Kernels and Ideal PCA

We describe how cross-kernel matrices, that is, kernel matrices between the data and a custom chosen set of `feature spanning points' can be used for learning. The main potential of cross-kernels lies in the fact that (a) only one side of the matrix scales with the number of data points, and (b) cross-kernels, as opposed to the usual kernel matrices, can be used to certify for the data manifold. Our theoretical framework, which is based on a duality involving the feature space and vanishing ideals, indicates that cross-kernels have the potential to be used for any kind of kernel learning. We present a novel algorithm, Ideal PCA (IPCA), which cross-kernelizes PCA. We demonstrate on real and synthetic data that IPCA allows to (a) obtain PCA-like features faster and (b) to extract novel and empirically validated features certifying for the data manifold.

cs.LG↗

arXiv2014

Non-Commutative Gebauer-Moeller Criteria

For an efficient implementation of Buchberger's Algorithm, it is essential to avoid the treatment of as many unnecessary critical pairs or obstructions as possible. In the case of the commutative polynomial ring, this is achieved by the Gebauer-Moeller criteria. Here we present an adaptation of the Gebauer-Moeller criteria for non-commutative polynomial rings, i.e. for free associative algebras over fields. The essential idea is to detect unnecessary obstructions using other obstructions with or without overlap. Experiments show that the new criteria are able to detect almost all unnecessary obstructions during the execution of Buchberger's procedure.

math.RA↗

arXiv2014

Dual-to-kernel learning with ideals

In this paper, we propose a theory which unifies kernel learning and symbolic algebraic methods. We show that both worlds are inherently dual to each other, and we use this duality to combine the structure-awareness of algebraic methods with the efficiency and generality of kernels. The main idea lies in relating polynomial rings to feature space, and ideals to manifolds, then exploiting this generative-discriminative duality on kernel matrices. We illustrate this by proposing two algorithms, IPCA and AVICA, for simultaneous manifold and feature learning, and test their accuracy on synthetic and real world data.

stat.ML↗

arXiv2010

The Geometry of Border Bases

The main topic of the paper is the construction of various explicit flat families of border bases. To begin with, we cover the punctual Hilbert scheme Hilb^μ(A^n) by border basis schemes and work out the base changes. This enables us to control flat families obtained by linear changes of coordinates. Next we provide an explicit construction of the principal component of the border basis scheme, and we use it to find flat families of maximal dimension at each radical point. Finally, we connect radical points to each other and to the monomial point via explicit flat families on the principal component.

math.AC↗

arXiv2009

Subideal Border Bases

In modeling physical systems it is sometimes useful to construct border bases of 0-dimensional polynomial ideals which are contained in the ideal generated by a given set of polynomials. We define and construct such subideal border bases, provide some basic properties and generalize a suitable variant of the Buchberger-Moeller algorithm as well as the AVI-algorithm to the subideal setting. The subideal version of the AVI-algorithm is then applied to an actual industrial problem.

math.AC↗

arXiv2007

Deformations of Border Bases

Here we study the problem of generalizing one of the main tools of Groebner basis theory, namely the flat deformation to the leading term ideal, to the border basis setting. After showing that the straightforward approach based on the deformation to the degree form ideal works only under additional hypotheses, we introduce border basis schemes and universal border basis families. With their help the problem can be rephrased as the search for a certain rational curve on a border basis scheme. We construct the system of generators of the vanishing ideal of the border basis scheme in different ways and study the question of how to minimalize it. For homogeneous ideals, we also introduce a homogeneous border basis scheme and prove that it is an affine space in certain cases. In these cases it is then easy to write down the desired deformations explicitly.

math.AC↗