Related papers: Hilbert quasi-polynomial for order domains and app…
In a recent paper with Sahi and Stokman, we introduced quasi-polynomial generalizations of Macdonald polynomials for arbitrary root systems via a new class of representations of the double affine Hecke algebra. These objects depend on a…
Homology has long been accepted as an important computable tool for quantifying complex structures. In many applications, these structures arise as nodal domains of real-valued functions and are therefore amenable only to a numerical study…
We study QPT (quasi-polynomial tractability) in the worst case setting for linear tensor product problems defined over Hilbert spaces. We assume that the domain space is a reproducing kernel Hilbert space so that function values are well…
In this paper, we develop a computationally simpler version of the operator count heuristic for a particular class of domains. The contribution of this abstract is threefold, we (1) propose an efficient closed form approximation to the…
Recent works have shown that quantum computers can polynomially speed up certain SAT-solving algorithms even when the number of available qubits is significantly smaller than the number of variables. Here we generalise this approach. We…
This is a companion paper to arXiv:2312.10772. We deduce an equidistribution theorem for periodic nilsequences and use this theorem to give two applications in arithmetic combinatorics. The first application is quasi-polynomial bounds for a…
Quasi-Newton methods refer to a class of algorithms at the interface between first and second order methods. They aim to progress as substantially as second order methods per iteration, while maintaining the computational complexity of…
We describe efficient algorithms to search for cases in which binomial coefficients are equal or almost equal, give a conjecturally complete list of all cases where two binomial coefficients differ by 1, and give some identities for…
Using the framework of a previous article joint with Axelsson and McIntosh, we extend to systems two results of S. Hofmann for real symmetric equations and their perturbations going back to a work of B. Dahlberg for Laplace's equation on…
We report on a recent implementation of Giesbrecht's algorithm for factoring polynomials in a skew-polynomial ring. We also discuss the equivalence between factoring polynomials in a skew-polynomial ring and decomposing $p^s$-polynomials…
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
The purpose of this paper is to provide tools for analyzing the compactness of sequences in Sobolev spaces, in particular if the sequence gets mapped onto a compact set by some nonlinear operator. Here, our focus lies on a very general…
We introduce the notion of "quasi-symmetric" polynomials, which is a generalization of the notion of symmetry, and is particularly suited to the setting of polynomial rings over finite fields. The properties of this new class of functions…
This paper introduces a learning scheme to construct a Hilbert space (i.e., a vector space along its inner product) to address both unsupervised and semi-supervised domain adaptation problems. This is achieved by learning projections from…
Necessary and sufficient conditions for a dense subspace of a Hilbert space to be a linear Hilbertian manifold domain are given. Some relations between linear Hilbertian manifold domains and domains of self-adjoint operators are found.
We show that, for a system of univariate polynomials given in sparse encoding, we can compute a single polynomial defining the same zero set, in time quasi-linear in the logarithm of the degree. In particular, it is possible to determine…
We give a polynomial time algorithm to decode multivariate polynomial codes of degree $d$ up to half their minimum distance, when the evaluation points are an arbitrary product set $S^m$, for every $d < |S|$. Previously known algorithms can…
This paper considers the equivalence problem for quasi-cyclic codes over finite fields. The results obtained are used to construct isodual quasi-cyclic codes.
We present a first exact study on higher-dimensional packing problems with order constraints. Problems of this type occur naturally in applications such as logistics or computer architecture and can be interpreted as higher-dimensional…
Motivated by a question in Schubert calculus, we study the interplay of quasisymmetric polynomials with the divided symmetrization operator, which was introduced by Postnikov in the context of volume polynomials of permutahedra. Divided…