相关论文: A SUBSET-SUM Characterisation of the A-Hierarchy

Based on a reduction processing, we rewrite a hypergeometric term as the sum of the difference of a hypergeometric term and a reduced hypergeometric term (the reduced part, in short). We show that when the initial hypergeometric term has a…

We study the parameterized complexity of algorithmic problems whose input is an integer set $A$ in terms of the doubling constant $C := |A + A|/|A|$, a fundamental measure of additive structure. We present evidence that this new…

Graphings serve as limit objects for bounded-degree graphs. We define the ``cycle matroid'' of a graphing as a submodular setfunction, with values in [0,1], which generalizes (up to normalization) the cycle matroid of finite graphs. We…

We present a development of norms and discuss their relationship to factorization. In earlier work, the first named author introduced the notion of a normset, which is the image of the norm map. A normset is a monoid with its own…

In additive number theory, a finite set $A$ of integers is an $h$-basis for $n$ if every integer in $\{0,1,2,\ldots, n\}$ can be represented as the sum of exactly $h$ not necessarily distinct elements of $A$. This paper introduces a new…

We give simple characterizations of the category PAsm(A) of partitioned assemblies, and of the realizability topos RT(A) over a partial combinatory algebra A. This answers the question for an 'extensional characterization' of realizability…

The subset sum problem is known to be an NP-hard problem in the field of computer science with the fastest known approach having a run-time complexity of $O(2^{0.3113n})$. A modified version of this problem is known as the perfect sum…

We establish a condition (so called generalized entropic property), equivalent to the fact that for every algebra A from a given variety V, the set of all subalgebras of A is a subuniverse of the complex algebra of A. We investigate the…

Let $\mathrm{R}$ be a real closed field and $\mathrm{D} \subset \mathrm{R}$ an ordered domain. We consider the algorithmic problem of computing the generalized Euler-Poincar\'e characteristic of real algebraic as well as semi-algebraic…

This paper concerns the notion of a symmetric algebra and its generalization to a quasi-symmetric algebra. We study the structure of these algebras in respect to their hull-kernel regularity and existence of some ideals, especially the…

Tree-width is an invaluable tool for computational problems on graphs. But often one would like to compute on other kinds of objects (e.g. decorated graphs or even algebraic structures) where there is no known tree-width analogue. Here we…

Given a definably amenable approximate subgroup $A$ of a (local) group in some first-order structure, there is a type-definable subgroup $H$ normalised by $A$ and contained in $A^4$ such that every definable superset of $H$ has positive…

\"Uberhomology is a recently defined homology theory for simplicial complexes, which yields subtle information on graphs. We prove that bold homology, a certain specialisation of \"uberhomology, is related to dominating sets in graphs. To…

Given $(a_1, \dots, a_n, t) \in \mathbb{Z}_{\geq 0}^{n + 1}$, the Subset Sum problem ($\mathsf{SSUM}$) is to decide whether there exists $S \subseteq [n]$ such that $\sum_{i \in S} a_i = t$. There is a close variant of the $\mathsf{SSUM}$,…

Graph homomorphism has been studied intensively. Given an m x m symmetric matrix A, the graph homomorphism function is defined as \[Z_A (G) = \sum_{f:V->[m]} \prod_{(u,v)\in E} A_{f(u),f(v)}, \] where G = (V,E) is any undirected graph. The…

A heuristic extending the Squarified Treemap technique for the representation of hierarchical information as treemaps is presented. The original technique gives high quality treemap views, since items are laid out with rectangles that…

Considering the sets of subsums of series (or achievement sets) we show that for conditionally convergent series the multidimensional case is much more complicated than that of the real line. Although we are far from the full topological…

The modeling framework of port-Hamiltonian systems is systematically extended to constrained dynamical systems (descriptor systems, differential-algebraic equations). A new algebraically and geometrically defined system structure is…

We introduce the study of parametrized higher category theory and parametrized higher algebra, and we describe the main theorems of the series of Expos\'es that make up the monograph.

Representations of nonnegative polynomials as sums of squares are central to real algebraic geometry and the subject of active research. The sum-of-squares representations of a given polynomial are parametrized by the convex body of…