相关论文: Central sets defined by words of low factor comple…

Traditional language models treat language as a finite state automaton on a probability space over words. This is a very strong assumption when modeling something inherently complex such as language. In this paper, we challenge this by…

In recent years, central components of a new approach to linguistics, the Minimalist Program (MP) have come closer to physics. Features of the Minimalist Program, such as the unconstrained nature of recursive Merge, the operation of the…

A \emph{strong coreset} for the mean queries of a set $P$ in ${\mathbb{R}}^d$ is a small weighted subset $C\subseteq P$, which provably approximates its sum of squared distances to any center (point) $x\in {\mathbb{R}}^d$. A \emph{weak…

There are different ways to define similarity for grouping similar texts into clusters, as the concept of similarity may depend on the purpose of the task. For instance, in topic extraction similar texts mean those within the same semantic…

We treat here the interrelation between formal languages and those dynamical systems that can be described by cellular automata (CA). There is a well-known injective map which identifies any CA-invariant subshift with a central formal…

Time-series classification has attracted considerable research attention due to the various domains where time-series data are observed, ranging from medicine to econometrics. Traditionally, the focus of time-series classification has been…

Clustering token-level contextualized word representations produces output that shares many similarities with topic models for English text collections. Unlike clusterings of vocabulary-level word embeddings, the resulting models more…

Combinatorial topology is used in distributed computing to model concurrency and asynchrony. The basic structure in combinatorial topology is the simplicial complex, a collection of subsets called simplices of a set of vertices, closed…

We consider ideals arising in the context of conditional independence models that generalize the class of ideals considered by Fink [7] in a way distinct from the generalizations of Herzog-Hibi-Hreinsdottir-Kahle-Rauh [13] and Ay-Rauh [1].…

Given an ideal $\mathcal{I}$ on $\omega$, we prove that a sequence in a topological space $X$ is $\mathcal{I}$-convergent if and only if there exists a ``big'' $\mathcal{I}$-convergent subsequence. Then, we study several properties and show…

Let $X$ be an uncountable Polish space and let $\mathcal{I}$ be an ideal on $\omega$. A point $\eta \in X$ is an $\mathcal{I}$-limit point of a sequence $(x_n)$ taking values in $X$ if there exists a subsequence $(x_{k_n})$ convergent to…

Given a countable set X (usually taken to be the natural numbers or the integers), an infinite permutation \pi of X is a linear ordering of X. This paper investigates the combinatorial complexity of the infinite permutation on the natural…

Sumsets are central objects in additive combinatorics. In 2007, Granville asked whether one can efficiently recognize whether a given set $S$ is a sumset, i.e. whether there is a set $A$ such that $A+A=S$. Granville suggested an algorithm…

The combination of the group ring setting with the methods of character theory allows an elegant and powerful analysis of various combinatorial structures, via their character sums. These combinatorial structures include difference sets,…

Let $X$ be a first countable space which admits a non-trivial convergent sequence and let $\mathcal{I}$ be an analytic P-ideal. First, it is shown that the sets of $\mathcal{I}$-limit points of all sequences in $X$ are closed if and only if…

Morphisms are homomorphisms under the concatenation operation of the set of words over a finite set. Changing the elements of the finite set does not essentially change the morphism. We propose a way to select a unique representing member…

Tree sets are posets with additional structure that generalize tree-like objects in graphs, matroids, or other combinatorial structures. They are a special class of abstract separation systems. We study infinite tree sets and how they…

A theoretical development is carried to establish fundamental results about rank-initial embeddings and automorphisms of countable non-standard models of set theory, with a keen eye for their sets of fixed points. These results are then…

This paper illustrates the richness of the concept of regular sets of time bounds and demonstrates its application to problems of computational complexity. There is a universe of bounds whose regular subsets allow to represent several time…

Clustering is a NP-hard problem. Thus, no optimal algorithm exists, heuristics are applied to cluster the data. Heuristics can be very resource-intensive, if not applied properly. For substantially large data sets computational efficiencies…