English
Related papers

Related papers: On perfectly meager sets

200 papers

A set A of positive integers is called a perfect difference set if every nonzero integer has an unique representation as the difference of two elements of A. We construct dense perfect difference sets from dense Sidon sets. As a consequence…

Number Theory · Mathematics 2016-12-30 Javier Cilleruelo , Melvyn B. Nathanson

A set is called recurrent if its minimal automaton is strongly connected and birecurrent if it is recurrent as well as its reversal. We prove a series of results concerning birecurrent sets. It is already known that any birecurrent set is…

Formal Languages and Automata Theory · Computer Science 2018-04-06 Francesco Dolce , Dominique Perrin , Antonio Restivo , Christophe Reutenauer , Giuseppina Rindone

We call a finite, spanning set of a semi-simple real Lie algebra a distinguished set if it satisfies the following property: The Lie bracket of any two elements out of the set is, up to some constant, another element in the set; conversely,…

Rings and Algebras · Mathematics 2020-04-28 Xudong Chen , Bahman Gharesifard

We analyze the periodicity of optimal long products of matrices. A set of matrices is said to have the finiteness property if the maximal rate of growth of long products of matrices taken from the set can be obtained by a periodic product.…

Dynamical Systems · Mathematics 2007-05-23 Raphael M. Jungers , Vincent D. Blondel

It is shown that (1) if a good set has finitely many related components, then they are full, (2) loops correspond one-to-one to extreme points of a convex set. Some other properties of good sets are discussed.

General Mathematics · Mathematics 2007-05-23 K Gowri Navada

A given subset $A$ of natural numbers is said to be complete if every element of $\mathbb{N}$ is the sum of distinct terms taken from $A$. This topic is strongly connected to the knapsack problem which is known to be NP complete.…

Combinatorics · Mathematics 2023-04-05 Norbert Hegyvári

The set of associative and commutative hypercomplex numbers, called the perfect hypercomplex algebra (PHA) is investigated. Necessary and sufficient conditions for an algebra to be a PHA via semi-tensor product(STP) of matrices are…

Rings and Algebras · Mathematics 2021-05-10 Daizhan Cheng , Zhengping Ji

W. Hurewicz proved that analytic Menger sets of reals are $\sigma$-compact and that co-analytic completely Baire sets of reals are completely metrizable. It is natural to try to generalize these theorems to projective sets. This has…

General Topology · Mathematics 2018-03-12 Franklin D. Tall , Lyubomyr Zdomskyy

We describe a simple machinery which translates results on algebraic sums of sets of reals into the corresponding results on their cartesian product. Some consequences are: 1. The product of a meager/null-additive set and a strong measure…

Logic · Mathematics 2010-08-02 Boaz Tsaban , Tomasz Weiss

In the present article we investigate Darji's notion of Haar meager sets from several directions. We consider alternative definitions and show that some of them are equivalent to the original one, while others fail to produce interesting…

General Topology · Mathematics 2015-10-07 Martin Doležal , Martin Rmoutil , Benjamin Vejnar , Václav Vlasák

A group-word w is called concise if whenever the set of w-values in a group G is finite it always follows that the verbal subgroup w(G) is finite. More generally, a word w is said to be concise in a class of groups X if whenever the set of…

Group Theory · Mathematics 2014-06-30 Robert Guralnick , Pavel Shumyatsky

A subset of a topological space is said to be \emph{universally measurable} if it is measured by the completion of each countably additive $\sigma$-finite Borel measure on the space, and \emph{universally null} if it has measure zero for…

Logic · Mathematics 2010-03-15 Paul Larson , Itay Neeman , Saharon Shelah

We prove that if $X$ is a Polish space and $F$ is a face of $P(X)$ with the Baire property, then $F$ is either a meager or a co-meager subset of $P(X)$. As a consequence we show that for every abelian Polish group $X$ and every analytic…

Functional Analysis · Mathematics 2010-06-15 Pandelis Dodos

A set $\mathcal{A}\subset \mathbb{N}$ is called additively decomposable (resp. asymptotically additively decomposable) if there exist sets $\mathcal{B},\mathcal{C}\subset \mathbb{N}$ of cardinality at least two each such that…

Number Theory · Mathematics 2022-04-26 P. -Y. Bienvenu

A set is introreducible if it can be computed by every infinite subset of itself. Such a set can be thought of as coding information very robustly. We investigate introreducible sets and related notions. Our two main results are that the…

Logic · Mathematics 2020-11-09 Noam Greenberg , Matthew Harrison-Trainor , Ludovic Patey , Dan Turetsky

We give a unified treatment of the countable dense homogeneity of products of Polish spaces, with a focus on uncountable products. Our main result states that a product of fewer than $\mathfrak{p}$ Polish spaces is countable dense…

General Topology · Mathematics 2025-10-30 Andrea Medini , Juris Steprāns

We discuss the relationship between perfect sets of random reals, dominating reals, and the product of two copies of the random algebra B. Recall that B is the algebra of Borel sets of 2^omega modulo the null sets. Also given two models M…

Logic · Mathematics 2008-02-03 Jörg Brendle , Haim Judah

A subset of a group is said to be product-free if it does not contain three elements satisfying the equation $xy=z$. We give a negative answer to a question of Babai and S\'os on the existence of large product-free sets by model theoretic…

Group Theory · Mathematics 2019-07-31 Daniel Palacín

If ZFC is consistent, then each of the following are consistent with ZFC + 2^{{aleph_0}}= aleph_2 : 1.) X subseteq R is of strong measure zero iff |X| <= aleph_1 + there is a generalized Sierpinski set. 2.) The union of aleph_1 many strong…

Logic · Mathematics 2009-09-25 Martin Goldstern , Haim Judah , Saharon Shelah

Given a linear equation L, a set A of integers is L-free if A does not contain any non-trivial solutions to L. Meeks and Treglown showed that for certain kinds of linear equations, it is NP-complete to decide if a given set of integers…

Combinatorics · Mathematics 2018-12-24 Keith J. Edwards , Steven D. Noble