相关论文: Problems in additive number theory, VI: Sizes of s…

We study the concept of universal sets from the additive--combinatorial point of view. Among other results we obtain some applications of this type of uniformity to sets avoiding solutions to linear equations, and get an optimal upper bound…

In this paper we collect some open set-theoretic problems that appear in the large-scale topology (called also Asymptology). In particular we ask problems about critical cardinalities of some special (large, indiscrete, inseparated) coarse…

We present some results on character degree sums in connection with certain characteristics of finite groups such as p-solvability, solvability, supersolvability, and nilpotency. Some of them strengthen known results in the literature.

In this paper we study combinatorial and algorithmic resp. complexity questions of upper domination, i.e., the maximum cardinality of a minimal dominating set in a graph. We give a full classification of the related maximisation and…

We aim at studying collections of algebraic structures defined over a commutative ring and investigating the complexity of significant constructions carried out on these objects. The assignment of measures of size, via a multiplicity…

In this paper we start to investigate a new body of questions in additive combinatorics. The fundamental Cauchy--Davenport theorem gives a lower bound on the size of a sumset A+B for subsets of the cyclic group Zp of order p (p prime), and…

Let $A$ be a finite set of $k$ integers. For $h \leq k$, the restricted $h$-fold sumset $h^{\wedge} A$ is the set of all sums of $h$ distinct elements of $A$. In additive combinatorics, much of the focus has traditionally been on finite…

We consider the classical problem of determining the largest possible cardinality of a minimal presentation of a numerical monoid with given embedding dimension and multiplicity. Very few values of this cardinality are known. In addressing…

We study a class of fractional $p$-Laplacian problems with weights which are possibly singular on the boundary of the domain. We provide existence and multiplicity results as well as characterizations of critical groups and related…

We study a family of groups consisting of the simplest extensions of lamplighter groups. We use these groups to answer multiple open questions in combinatorial group theory, providing groups that exhibit various combinations of properties:…

We introduce the notion of limiting theories, giving examples and providing a sufficient condition under which the first order theory of a structure is the limit of the first order theories of a collection of substructures. We also give a…

We provide a complete classification of the singularities of cluster algebras of finite cluster type. This extends our previous work about the case of trivial coefficients. Additionally, we classify the singularities of cluster algebras for…

The purpose of the article is to provide an unified way to formulate zero-sum invariants. Let $G$ be a finite additive abelian group. Let $B(G)$ denote the set consisting of all nonempty zero-sum sequences over G. For $\Omega \subset B(G$),…

We describe general connections between intersective properties of sets in Abelian groups and positive exponential sums. In particular, given a set $A$ the maximal size of a set whose difference set avoids $A$ will be related to positive…

Large cardinals arising from the existence of arbitrarily long end elementary extension chains over models of set theory are studied here. In particular, we show that the large cardinals obtained that way (`Unfoldable cardinals') behave as…

We point out that a sequence of natural numbers is the dimension sequence of a subproduct system if and only if it is the cardinality sequence of a word system (or factorial language). Determining such sequences is, therefore, reduced to a…

We study relations between subsets of integers that are large, where large can be interpreted in terms of size (such as a set of positive upper density or a set with bounded gaps) or in terms of additive structure (such as a Bohr set). Bohr…

(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…

Let A, B and S be three subsets of a finite Abelian group G. The restricted sumset of A and B with respect to S is defined as A\wedge^{S} B= {a+b: a in A, b in B and a-b not in S}. Let L_S=max_{z in G}| {(x,y): x,y in G, x+y=z and x-y in…

We consider the problem of correlation clustering on graphs with constraints on both the cluster sizes and the positive and negative weights of edges. Our contributions are twofold: First, we introduce the problem of correlation clustering…