相关论文: Mailles et ensembles de Sidon
We introduce the notion of unavoidable (complete) sets of word patterns, which is a refinement for that of words, and study certain numerical characteristics for unavoidable sets of patterns. In some cases we employ the graph of pattern…
We present stability conditions for the category of coherent systems on an integral curve. We define a three-parameter family of pre-stability conditions in its derived category using tilting, and we then investigate when these conditions…
An $S_k$-set in a group $\Gamma$ is a set $A\subseteq\Gamma$ such that $\alpha_1\cdots\alpha_k=\beta_1\cdots\beta_k$ with $\alpha_i,\beta_i\in A$ implies $(\alpha_1,\ldots,\alpha_k)=(\beta_1,\ldots,\beta_k)$. An $S_k'$-set is a set such…
A sequence of non-negative integers is exactly realizable as the fixed point counts sequence of a dynamical system if and only if it gives rise to a sequence of non-negative orbit counts. This provides a simple realizability criterion based…
Neighborhood is an important concept in covering based rough sets. That under what condition neighborhoods form a partition is a meaningful issue induced by this concept. Many scholars have paid attention to this issue and presented some…
This Letter provides necessary and sufficient conditions on the excitation and measurement pattern (EMP) that guarantee identifiability of a dynamical network that has the structure of a loop. The conditions are extremely simple in their…
A graph $G=(V,E)$ is $d$-sparse if each subset $X\subseteq V$ with $|X|\geq d$ induces at most $d|X|-{{d+1}\choose{2}}$ edges in $G$. Maxwell showed in 1864 that a necessary condition for a generic bar-and-joint framework with at least…
It is shown that a necessary condition for an abstract group G to be the full automorphism group of a Hamiltonian cycle system is that G has odd order or it is either binary, or the affine linear group AGL(1; p) with p prime. We show that…
For a partition {\lambda} and a prime p, we prove a necessary and sufficient condition for there exists a composition {\delta} such that {\delta} can be obtained from {\lambda} after rearrangement and all the partial sums of {\delta} are…
A geometric grid class consists of those permutations that can be drawn on a specified set of line segments of slope \pm1 arranged in a rectangular pattern governed by a matrix. Using a mixture of geometric and language theoretic methods,…
Necessary and sufficient conditions for finite semihypergroups to be built from groups of the same order are established
Requiring an infinite number of conserved local charges or the existence of an underlying linear system does not uniquely determine the Moyal deformation of 1+1 dimensional integrable field theories. As an example, the sine-Gordon model may…
In this short note we prove a hierarchical stability result that applies to hybrid dynamical systems satisfying the hybrid basic conditions of (Goebel et al., 2012). In particular, we establish sufficient conditions for uniform asymptotic…
In a recent article, Donoso, Le, Moreira and Sun studied sets of recurrence for actions of the multiplicative semigroup $(\mathbb{N}, \times)$ and provided some sufficient conditions for sets of the form $S=\{(an+b)/(cn+d) \colon n \in…
We introduce and characterise grid classes, which are natural generalisations of other well-studied permutation classes. This characterisation allows us to give a new, short proof of the Fibonacci dichotomy: the number of permutations of…
The following theorem is proved: Let $G$ be a finite group and $\pi_e(G)$ be the set of element orders in $G$. If $\pi_e(G) \cap \{2\}=\emptyset$; or $\pi_e(G) \cap \{3, 4\}=\emptyset$; or $\pi_e(G) \cap \{3,5\}=\emptyset$, then $G$ is…
A row and a column of two linear relations in Hilbert spaces are presented respectively as a sum and an intersection of two linear relations. As an application, necessary and sufficient conditions for the adjoint of a column to be a row are…
We give simple necessary and sufficient conditions on projective schemes over a field k for asymptotic limits of the growth of all graded linear series of a fixed Kodaira-Iitaka dimension to exist. We also give necessary and sufficient…
The number of steps required to exhaust a point set by iteratively removing the vertices of its convex hull is called the layer number of the point set. This article presents a short proof that the layer number of the grid…
Recently, sufficient conditions of stability or instability for time-delay systems have been proven to be necessary. In this way, a remarkable necessary and sufficient condition has then been developed by Gomez et al. It is presented as a…