相关论文: Central sets defined by words of low factor comple…
It is known when we call a poset P, a $\mathcal{P}$-chain permutational poset, given a subset of permutations $\mathcal{P}$ of the symmetric group $S_{n}$. In this work, we use the same idea to study subsets of words of length $n$, that are…
This is the first paper that provides a systematic treatment of the $r$-dimensional PTE problem in additive number theory, abbreviated by PTE$_r$, through its connection with combinatorial design theory, the branch of combinatorial…
We present an standard constraints generation algorithm to find an explicit set whose robustness is equal to the robustness of the feasible solution set of a combinatorial optimization problem with cost uncertainty. Computational experience…
We introduce a method for constructing collections of subsets of $\mathbb{R}^{n}$, using an iterated function system, a set $T,$ and a cost function. We refer to these collections as tilings. The special case where $T$ is the central open…
We introduce and study a new topological notion of the size for subsets of the real line, called \emph{super-density}. A set $A\subset\mathbb{R}$ is super-dense if for every non-empty open interval $I$ and every nowhere constant continuous…
Defant and Kravitz introduced generalizations of West's stack-sorting map $s$ from permutations to finite words. This raises questions as to how such generalizations could be applied in the field of combinatorics on words. The…
In the algebraic theory of codes and formal languages, the set $Q$ of all primitive words over some alphabet $\zi $ has received special interest. With this survey article we give an overview about relevant research to this topic during the…
The notion of a simplicial set originated in algebraic topology, and has also been utilized extensively in category theory, but until relatively recently was not used outside of those fields. However, with the increasing prominence of…
Given a finite set of words w1,...,wn independently drawn according to a fixed unknown distribution law P called a stochastic language, an usual goal in Grammatical Inference is to infer an estimate of P in some class of probabilistic…
We revisit the notion of initial sets by Xu and Cayrol, i.e., non-empty minimal admissible sets in abstract argumentation frameworks. Initial sets are a simple concept for analysing conflicts in an abstract argumentation framework and to…
First introduced in the study of the Sturmian words, the iterated palindromic closure was recently generalized to pseudopalindromes. This operator allows one to construct words with an infinity of pseudopalindromic prefixes, called…
Framed combinatorial topology is a novel theory describing combinatorial phenomena arising at the intersection of stratified topology, singularity theory, and higher algebra. The theory synthesizes elements of classical combinatorial…
We give an in depth analysis of the subwords of the Thue-Morse sequence. This allows us to prove that there are infinitely many injective primitive substitutions with Perron-Frobenius eigenvalue 2 that generate a symbolic dynamical system…
We consider integer programs whose constraint matrix has a special block structure: $\min\{f(x):H_{com}x=b, l\le x\le u,x\in\mathbb{Z}^{t_B+nt_A}\}$, where the objective function $f$ is separable convex and the constraint matrix $H_ {com}$…
Conrey, Farmer, Keating, Rubinstein and Snaith have given a recipe that conjecturally produces, among others, the full moment polynomial for the Riemann zeta function. The leading term of this polynomial is given as a product of a factor…
A set of words, also called a language, is letter-balanced if the number of occurrences of each letter only depends on the length of the word, up to a constant. Similarly, a language is factor-balanced if the difference of the number of…
Existing Image Captioning (IC) systems model words as atomic units in captions and are unable to exploit the structural information in the words. This makes representation of rare words very difficult and out-of-vocabulary words impossible.…
The compositionality degree of multiword expressions indicates to what extent the meaning of a phrase can be derived from the meaning of its constituents and their grammatical relations. Prediction of (non)-compositionality is a task that…
In 1985, Golumbic and Scheinerman established an equivalence between comparability graphs and containment graphs, graphs whose vertices represent sets, with edges indicating set containment. A few years earlier, McMorris and Zaslavsky…
Sets with atoms serve as an alternative to ZFC foundations for mathematics, where some infinite, though highly symmetric sets, behave in a finitistic way. Therefore, one can try to carry over analysis of the classical algorithms from finite…