Related papers: Lengths of words in transformation semigroups gene…

The \textit{acyclic disconnection} $\overrightarrow{\omega }(D)$ (resp. the \textit{directed triangle free disconnection } $\overrightarrow{\omega }_{3}(D)$) of a digraph $D$ is defined as the maximum possible number of connected components…

Let $X$ be a nonempty set and $T(X)$ the full transformation semigroup on $X$. For any equivalence relation $E$ on $X$, define a subsemigroup $T_{E^*}(X)$ of $T(X)$ by $$ T_{E^*}(X)=\{\alpha\in T(X):\text{for all}\ x,y\in X, (x,y)\in…

For a finite abelian group $G$ and a positive integer $k$, let $s_{k}(G)$ denote the smallest integer $\ell\in\mathbb{N}$ such that any sequence $S$ of elements of $G$ of length $|S|\geq\ell$ has a zero-sum subsequence with length $k$. The…

In a digraph, a quasi-kernel is a subset of vertices that is independent and such that every vertex can reach some vertex in that set via a directed path of length at most two. Whereas Chv\'atal and Lov\'asz proved in 1974 that every…

A semigroup (dynamical system) generated by $C^{1+\alpha}$-contracting mappings is considered. We call a such semigroup regular if the maximum $K$ of the conformal dilatations of generators, the maximum $l$ of the norms of the derivatives…

We study finite-rank left-translation invariant algebraic $D$-modules on complex affine algebraic groups. Using the standard description of these objects as left-invariant flat algebraic connections on the trivial vector bundle, modulo…

Let $G$ be a group and $A\subseteq [1,\exp(G)-1]$. We define the constant ${\sf C}_A(G),$ which is the least positive integer $\ell$ such that every sequence over $G$ of length at least $\ell$ has an $A$-weighted consecutive product-one…

Given a 2-edge-coloring $f : E(K_n) \rightarrow \{\pm 1\}$, the discrepancy of a subgraph $F \subseteq K_n$ is defined as $\left| \sum_{e \in E(F)} f(e) \right|$. Erd\H{o}s, F\"uredi, Loebl and S\'os showed that if $F$ is an $n$-vertex tree…

A celebrated result of Alon from 1993 states that any $d$-regular graph on $n$ vertices (where $d=O(n^{1/9})$) has a bisection with at most $\frac{dn}{2}(\frac{1}{2}-\Omega(\frac{1}{\sqrt{d}}))$ edges, and this is optimal. Recently, this…

In this paper we consider the following problems: how many different subsets of Sigma^n can occur as set of all length-n factors of a finite word? If a subset is representable, how long a word do we need to represent it? How many such…

A set of vertices $S$ \emph{resolves} a connected graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The \emph{metric dimension} of $G$ is the minimum cardinality of a resolving set of $G$.…

This paper is focused on numerical semigroups and presents a simple construction, that we call dilatation, which, from a starting semigroup $S$, permits to get an infinite family of semigroups which share several properties with $S$. The…

The norm closure of the algebra generated by the set $\{n\mapsto {\lambda}^{n^k}:$ $\lambda\in{\mathbb {T}}$ and $k\in{\mathbb{N}}\}$ of functions on $({\mathbb {Z}}, +)$ was studied in \cite{S} (and was named as the Weyl algebra). In this…

Let $G$ be a random torsion-free nilpotent group generated by two random words of length $\ell$ in $U_n(\mathbb{Z})$. Letting $\ell$ grow as a function of $n$, we analyze the step of $G$, which is bounded by the step of $U_n(\mathbb{Z})$.…

We define the contact homology algebra for any contact manifold and show that it is an invariant of the contact manifold. More precisely, given a contact manifold $(M,\xi)$ and some auxiliary data $\mathcal{D}$, we define an algebra…

Let $Di\langle X\rangle$ be the free dialgebra over a field generated by a set $X$. Let $S$ be a monic subset of $Di\langle X\rangle$. A Composition-Diamond lemma for dialgebras is firstly established by Bokut, Chen and Liu in 2010…

Regular word grammars are restricted context-free grammars that define all the recognizable languages of words. This paper generalizes regular grammars from words to certain classes of graphs, by defining regular grammars for unordered…

Consider a random regular graph with degree $d$ and of size $n$. Assign to each edge an i.i.d. exponential random variable with mean one. In this paper we establish a precise asymptotic expression for the maximum number of edges on the…

We study properties of random subcomplexes of partitions returned by (a suitable form of) the Strong Hypergraph Regularity Lemma, which we call regular slices. We argue that these subcomplexes capture many important structural properties of…

A finitely generated subgroup {\Gamma} of a real Lie group G is said to be Diophantine if there is \beta > 0 such that non-trivial elements in the word ball B_\Gamma(n) centered at the identity never approach the identity of G closer than…