相关论文: A SUBSET-SUM Characterisation of the A-Hierarchy
We investigate a hierarchy of arithmetical structures obtained by a transfinite addition of a canonic universal predicate, where the canonic universal predicate for M is defined as a minimum universal predicate for M in terms of…
We compare two kinds of unification problems: Asymmetric Unification and Disunification, which are variants of Equational Unification. Asymmetric Unification is a type of Equational Unification where the right-hand sides of the equations…
For a set $A$ of integers, the sumset $lA =A+...+A$ consists of those numbers which can be represented as a sum of $l$ elements of $A$ $$lA =\{a_1+... a_l| a_i \in A_i \}. $$ A closely related and equally interesting notion is that of…
Power series in which the summand satisfies a linear recurrence relation with polynomial coefficients are shown to be the solution of a linear differential or algebraic equation. Solving the associated differential or algebraic equation…
The moment-sum-of-squares (moment-SOS) hierarchy is one of the most celebrated and widely applied methods for approximating the minimum of an n-variate polynomial over a feasible region defined by polynomial (in)equalities. A key feature of…
We introduce the notion of a generalised symmetry M of a hamiltonian H. It is a symmetry which has been broken in a very specific manner, involving ladder operators R and R*. In Theorem 1 these generalised symmetries are characterised in…
We discuss approximability and inapproximability in FPT-time for a large class of subset problems where a feasible solution $S$ is a subset of the input data and the value of $S$ is $|S|$. The class handled encompasses many well-known…
The purpose of this paper is to generalize this relation of symmetry between the power sum polynomials and the generalized Euler polynomials to the relation between the power sum polynomials and the generalized higher-order Euler…
Let $\mathbf{A} = (A_1,\ldots, A_q)$ be a $q$-tuple of finite sets of integers. Associated to every $q$-tuple of nonnegative integers $\mathbf{h} = (h_1,\ldots, h_q)$ is the linear form $\mathbf{h}\cdot \mathbf{A} = h_1 A_1 + \cdots +…
We discuss various aspects of representation of a polynomial as a sum of monomials (for example, uniqueness of such representation and related estimations).
We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…
The article addresses the problem whether indefinite double sums involving a generic sequence can be simplified in terms of indefinite single sums. Depending on the structure of the double sum, the proposed summation machinery may provide…
Polynomials are common algebraic structures, which are often used to approximate functions including probability distributions. This paper proposes to directly define polynomial distributions in order to describe stochastic properties of…
We describe a framework for systematic enumeration of families combinatorial structures which possess a certain regularity. More precisely, we describe how to obtain the differential equations satisfied by their generating series. These…
The concept of complexity appears in virtually all areas of knowledge. Its intuitive meaning shares similarities across fields, but disagreements between its details hinders a general definition, leading to a plethora of proposed…
This paper studies the polynomial optimization problem whose feasible set is a union of several basic closed semialgebraic sets. We propose a unified hierarchy of Moment-SOS relaxations to solve it globally. Under some assumptions, we prove…
In this talk, we describe our recent results on the supersymmetrization of the Harry Dym hierarchy as well as a newly constructed deformed Harry Dym hierarchy which is integrable with two arbitrary parameters. In various limits of these…
Closed subschemes in projective space with a fixed Hilbert polynomial are parametrized by a Hilbert scheme. We classify the smooth ones. We identify numerical conditions on a polynomial that completely determine when the Hilbert scheme is…
If F is a type-definable family of commensurable subsets, subgroups or sub-vector spaces in a metric structure, then there is an invariant subset, subgroup or sub-vector space commensurable with F. This in particular applies to…
A new approach is suggested to the problem of quantising causal sets, or topologies, or other such models for space-time (or space). The starting point is the observation that entities of this type can be regarded as objects in a category…