Related papers: An algorithm for computing syzygies on $V[X]$ when…

Let G be a reductive complex algebraic group and V a finite-dimensional G-module. From elements of the invariant algebra C[V]^G we obtain by polarization elements of C[kV]^G, where k\geq 1 and kV denotes the direct sum of k copies of V. For…

This paper proposes a sequential design for maximizing a stochastic computer simulator output, y(x), over an unknown optimization domain. The training data used to estimate the optimization domain are a set of (historical) inputs, often…

We provide constructive versions of Hilbert's syzygy theorem for Z and Z/nZ following Schreyer's method. Moreover, we extend these results to arbitrary coherent strict B\'ezout rings with a divisibility test for the case of finitely…

We present a quantum algorithm to compute the logarithm of the determinant of the fermion matrix, assuming access to a classical lattice gauge field configuration. The algorithm uses the quantum eigenvalue transform, and quantum mean…

Valued constraint satisfaction problems (VCSPs) are a large class of combinatorial optimisation problems. It is desirable to classify the computational complexity of VCSPs depending on a fixed set of allowed cost functions in the input.…

We develop the first constructive algorithms for compiling single-qubit unitary gates into circuits over the universal $V$ basis. The $V$ basis is an alternative universal basis to the more commonly studied $\{H,T\}$ basis. We propose two…

We present an algorithm for computing the integral closure of a reduced ring that is finitely generated over a finite field.

We describe general methods for enumerating subsemigroups of finite semigroups and techniques to improve the algorithmic efficiency of the calculations. As a particular application we use our algorithms to enumerate all transformation…

We present an extension of an algorithm for computing directly the denotation of a mu-calculus formula X over the configuration graph of a pushdown system to allow backwards modalities. Our method gives the first extension of the saturation…

We develop a practical algorithm to decide whether a finitely generated subgroup of a solvable algebraic group $G$ is arithmetic. This incorporates a procedure to compute a generating set of an arithmetic subgroup of $G$. We also provide a…

In this work we explicitly calculate syzygies of quadratic Veronese embedding $\mathbb{P}(V)\subset\mathbb{P}(\operatorname{Sym}^2V)$ as representations of the group $\operatorname{GL}(V)$. Also resolutions of the sheaves…

We describe an algorithm for determining the algebraic subgroup of GL(n,C) that is defined as the closure of the group generated by a finite number of elements of GL(n,C). The algorithm avoids the use of Groebner bases and can be used on…

This paper proposes an extension of the finite cell method (FCM) to V-rep models, a novel geometric framework for volumetric representations. This combination of an embedded domain approach (FCM) and a new modeling framework (V-rep) forms…

We present in this paper a new procedure to saturate a set of clauses with respect to a well-founded ordering on ground atoms such that A < B implies Var(A) {\subseteq} Var(B) for every atoms A and B. This condition is satisfied by any atom…

A proper subsemigroup of a semigroup is maximal if it is not contained in any other proper subsemigroup. A maximal subsemigroup of a finite semigroup has one of a small number of forms, as described in a paper of Graham, Graham, and Rhodes.…

The fast assembling of stiffness and mass matrices is a key issue in isogeometric analysis, particularly if the spline degree is increased. We present two algorithms based on the idea of sum factorization, one for matrix assembling and one…

The probabilistic powerdomain $\mathbf V X$ on a space $X$ is the space of all continuous valuations on $X$. We show that, for every quasi-continuous domain $X$, $\mathbf V X$ is again a quasi-continuous domain, and that the Scott and weak…

A method how to construct Boolean-valued models of some fragments of arithmetic was developed in Krajicek (2011), with the intended applications in bounded arithmetic and proof complexity. Such a model is formed by a family of random…

Entanglement is a defining property of quantum systems. For a subsystem of a larger quantum system, one can formally define an operator known as the modular Hamiltonian, which is closely linked to the entanglement properties of that…

We consider a smooth Lagrangian subvariety Y in a smooth algebraic variety X with an algebraic symplectic from. For a vector bundle E on Y and a choice Oh of deformation quantization of the structure sheaf of X, we establish when E admits a…