English
Related papers

Related papers: Note as to inclusion-minimal non-Bondy systems

200 papers

In this paper it is proved that if a minimal system has the property that its sequence entropy is uniformly bounded for all sequences, then it has only finitely many ergodic measures and is an almost finite to one extension of its maximal…

Dynamical Systems · Mathematics 2020-02-21 Wen Huang , Zhengxing Lian , Song Shao , Xiangdong Ye

Suppose $a_n$ is a real, nonnegative sequence that does not increase exponentially. For any $p<1$ we contruct a Lebesgue measurable set $E \subseteq \mathbb{R}$ which has measure at least $p$ in any unit interval and which contains no…

Classical Analysis and ODEs · Mathematics 2024-12-18 Mihail N. Kolountzakis , Effie Papageorgiou

Suppose $\Lambda$ is a discrete infinite set of nonnegative real numbers. We say that $ {\Lambda}$ is type $1$ if the series $s(x)=\sum_{\lambda\in\Lambda}f(x+\lambda)$ satisfies a zero-one law. This means that for any non-negative…

Classical Analysis and ODEs · Mathematics 2018-06-01 Zoltán Buczolich , Bruce Hanson , Balázs Maga , Gáspár Vértesy

A set $A$ is MSTD (more-sum-than-difference) if $|A+A|>|A-A|$. Though MSTD sets are rare, Martin and O'Bryant proved that there exists a positive constant lower bound for the proportion of MSTD subsets of $\{1,2,\ldots ,r\}$ as…

Number Theory · Mathematics 2019-10-23 Hung Viet Chu , Noah Luntzlara , Steven J. Miller , Lily Shao

Consider nondeterministic finite automata recognizing base-k positional notation of numbers. Assume that numbers are read starting from their least significant digits. It is proved that if two sets of numbers S and T are represented by…

Formal Languages and Automata Theory · Computer Science 2009-07-30 Galina Jirásková , Alexander Okhotin

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 consider interconnected nonlinear systems with external inputs, where each of the subsystems is assumed to be input-to-state stable (ISS). Sufficient conditions of small gain type are provided guaranteeing that the interconnection is ISS…

Dynamical Systems · Mathematics 2010-06-14 Sergey Dashkovskiy , Michael Kosmykov , Fabian Wirth

Among other results, we prove that if $I$ is a monomial ideal of $S=K[x_1,\ldots,x_n]$, where $K$ is a field, and $a\geq b-1\geq0$ are integers such that $a+b\leq\mathrm{proj~dim}(S/I)$, then $$t_{a+b}\leq…

Commutative Algebra · Mathematics 2020-01-07 Abed Abedelfatah

We determine the groups of minimal order in which all groups of order n can embedded for 1 < n < 16. We further determine the order of a minimal group in which all groups or order n or less can be embedded, also for 1 < n < 16.

Group Theory · Mathematics 2017-06-29 Robert Heffernan , Des MacHale , Brendan McCann

Let $A = \{0 = a_0 < a_1 < \cdots < a_{\ell + 1} = b\}$ be a finite set of non-negative integers. We prove that the sumset $NA$ has a certain easily-described structure, provided that $N \geqslant b-\ell$, as recently conjectured by Shakan…

Number Theory · Mathematics 2021-04-01 Andrew Granville , Aled Walker

A condition characterizing the class of regular languages which have several nonisomorphic minimal reversible automata is presented. The condition concerns the structure of the minimum automaton accepting the language under consideration.…

Formal Languages and Automata Theory · Computer Science 2016-11-22 Giovanna J. Lavado , Giovanni Pighizzini , Luca Prigioniero

Let $C,W\subseteq \mathbb{Z}$. If $C+W=\mathbb{Z}$, then the set $C$ is called an additive complement to $W$ in $\mathbb{Z}$. If no proper subset of $C$ is an additive complement to $W$, then $C$ is called a minimal additive complement. Let…

Number Theory · Mathematics 2018-04-26 Sándor Z. Kiss , Csaba Sándor , Quan-Hui Yang

This paper gives a complete proof of a theorem of de Bruijn that classifies additive systems for the nonnegative integers, that is, families $\mca = (A_i)_{i\in I}$ of sets of nonnegative integers, each set containing 0, such that every…

Number Theory · Mathematics 2014-01-03 Melvyn B. Nathanson

In this paper, we prove the existence of minimizers of a class of multi-constrained variational problems. We consider systems involving a nonlinearity that does not satisfy compactness, monotonicity, neither symmetry properties. Our…

Analysis of PDEs · Mathematics 2013-10-10 Hichem Hajaiej , Peter A. Markowich , Saber Trabelsi

In this paper we prove that a set of points $B$ of PG(n,2) is a minimal blocking set if and only if $<B>=PG(d,2)$ with $d$ odd and $B$ is a set of $d+2$ points of $PG(d,2)$ no $d+1$ of them in the same hyperplane. As a corollary to the…

Group Theory · Mathematics 2007-08-20 Alireza Abdollahi , M. J. Ataei , A. Mohammadi Hassanabadi

Suppose that $A$, $B$ and $S$ are non-empty subsets of a finite abelian group $G$. Then the generalized restricted sumset $$ A\stackrel{S}+B:=\{a+b:\,a\in A,\ b\in B,\ a-b\not\in S\} $$ contains at least $$ \min\{|A|+|B|-3|S|,p(G)\} $$…

Number Theory · Mathematics 2016-09-13 Shanshan Du , Hao Pan

We show that, for a positive integer $r$, every minimal 1-saturating set in ${\rm PG}(r-1,2)$ of size at least ${11/36} 2^r+3$ is either a complete cap or can be obtained from a complete cap $S$ by fixing some $s\in S$ and replacing every…

Number Theory · Mathematics 2009-01-19 David J. Grynkiewicz , Vsevolod F. lev

A sequence $(e_i)_{i \le m}$ of nonnegative integers $e_i$, where $m \in \mathbb{N}$ or $m =\infty$, is called a binomid index if $\sum_{i=n-k+1}^{n} e_i\geq \sum_{i=1}^ke_i$ for all $k, n \in \mathbb{N}$ such that $ 1\le k \le n < m$.…

Combinatorics · Mathematics 2025-05-27 Jonathan Caalim , Yu-ichi Tanaka

We study parallel algorithms for addition of numbers having finite representation in a positional numeration system defined by a base $\beta$ in $\mathbb{C}$ and a finite digit set $\mathcal{A}$ of contiguous integers containing $0$. For a…

Number Theory · Mathematics 2016-10-27 Christiane Frougny , Edita Pelantova , Milena Svobodova

$S \subseteq \mathbb{Z}_{2n}$ is said to be sum-free if $S$ has no solution to the equation $a+b=c$. The sum-free process on $\mathbb{Z}_{2n}$ starts with $S:=\emptyset$, and iteratively inserts elements of $\mathbb{Z}_{2n}$, where each…

Combinatorics · Mathematics 2019-12-03 Patrick Bennett