Related papers: Polytime reductions of AF-algebraic problems
This paper revisits the equivalence problem between algebraic quantum field theories and prefactorization algebras defined over globally hyperbolic Lorentzian manifolds. We develop a radically new approach whose main innovative features are…
In the present paper, we derive formulas of complex and $\ell$-adic multiple polylogarithms, which have two aspects: a duality in terms of indexes and a reflection in terms of variables. We provide an algebraic proof of these formulas by…
We study vertex algebras and their modules associated with possibly degenerate even lattices, using an approach somewhat different from others. Several known results are recovered and a number of new results are obtained. We also study…
We prove the conjecture of Falikman--Friedland--Loewy on the parity of the degrees of projective varieties of $n\times n$ complex symmetric matrices of rank at most $k$. We also characterize the parity of the degrees of projective varieties…
This paper re-examines the use of response time to infer problem complexity. It revisits a canonical Wald model of optimal stopping, taking signal-to-noise ratio as a measure of problem complexity. While choice quality is monotone in…
Our topic is the use of machine learning to improve software by making choices which do not compromise the correctness of the output, but do affect the time taken to produce such output. We are particularly concerned with computer algebra…
We present a construction of autoequivalences of derived categories of symmetric algebras based on projective modules with periodic endomorphism algebras. This construction generalises autoequivalences previously constructed by…
(1) There is a finitely presented group with a word problem which is a uniformly effectively inseparable equivalence relation. (2) There is a finitely generated group of computable permutations with a word problem which is a universal…
In this study, we consider a class of linear matroid interdiction problems, where the feasible sets for the upper-level decision-maker (referred to as a leader) and the lower-level decision-maker (referred to as a follower) are induced by…
We introduce type-theoretic algebraic weak factorisation systems and show how they give rise to homotopy-theoretic models of Martin-L\"of type theory. This is done by showing that the comprehension category associated to a type-theoretic…
We investigate the problem of cryptanalysis as a problem belonging to the class NP. A class of problems UF is defined for which the time constructing any feasible solution is polynomial. The properties of the problems of NP, which may be…
This paper proposes improving the solve time of a bootstrap AMG designed previously by the authors. This is achieved by incorporating the information, set of algebraically smooth vectors, generated by the bootstrap algorithm, in a single…
We construct Lie algebras of derivations (and identify their geometrical realization) whose Maurer-Cartan sets provide moduli spaces describing the classes of homotopy types of rational spaces sharing either the same homotopy Lie algebra,…
We study and give a complete classification of good $\ZZ$-gradings of all simple finite-dimensional Lie algebras. This problem arose in the quantum Hamiltonian reduction for affine Lie algebras.
Variational formulations of time-dependent PDEs in space and time yield $(d+1)$-dimensional problems to be solved numerically. This increases the number of unknowns as well as the storage amount. On the other hand, this approach enables…
A space-time adaptive method is presented for the reactive Euler equations describing chemically reacting gas flow where a two species model is used for the chemistry. The governing equations are discretized with a finite volume method and…
The resonance varieties, the holonomy Lie algebra, and the holonomy Chen Lie algebra associated with the Orlik-Solomon algebra of a matroid provide an algebraic lens through which to examine the rich combinatorial structure of matroids and…
We study the optimization problem over the weakly Pareto set of a convex multiobjective optimization problem given by polynomial functions. Using Lagrange multiplier expressions and the weight vector, we give three types of representations…
While many classes of cutting-planes are at the disposal of integer programming solvers, our scientific understanding is far from complete with regards to cutting-plane selection, i.e., the task of selecting a portfolio of cutting-planes to…
Deliberating on large or continuous state spaces have been long standing challenges in reinforcement learning. Temporal Abstraction have somewhat made this possible, but efficiently planing using temporal abstraction still remains an issue.…