相关论文: Combined exponential patterns in multiplicative $I…

Asymptotic tensor rank is notoriously difficult to determine. Indeed, determining its value for the $2\times 2$ matrix multiplication tensor would determine the matrix multiplication exponent, a long-standing open problem. On the other…

Under what circumstances might every extension of a combinatorial structure contain more copies of another one than the original did? This property, which we call prolificity, holds universally in some cases (e.g., finite linear orders) and…

Detecting small sets of relevant patterns from a given dataset is a central challenge in data mining. The relevance of a pattern is based on user-provided criteria; typically, all patterns that satisfy certain criteria are considered…

In this paper we introduce a new type of pattern -- a flipping correlation pattern. The flipping patterns are obtained from contrasting the correlations between items at different levels of abstraction. They represent surprising…

Sequences that are defined by multisums of hypergeometric terms with compact support occur frequently in enumeration problems of combinatorics, algebraic geometry and perturbative quantum field theory. The standard recipe to study the…

In this article we develop the theory of residually finite rationally $p$ (RFR$p$) groups, where $p$ is a prime. We first prove a series of results about the structure of finitely generated RFR$p$ groups (either for a single prime $p$, or…

Finding the underlying probability distributions of a set of observed sequences under the constraint that each sequence is generated i.i.d by a distinct distribution is considered. The number of distributions, and hence the number of…

A deterministic sequence of real numbers in the unit interval is called \emph{equidistributed} if its empirical distribution converges to the uniform distribution. Furthermore, the limit distribution of the pair correlation statistics of a…

For a positive integer $n$, a collection $S$ of subsets of $[n]=\{1,\ldots,n\}$ is called symmetric if $X\in S$ implies $X^\ast\in S$, where $X^\ast:=\{i\in [n]\colon n-i+1\notin X\}$ (the involution $\ast$ was introduced by Karpman).…

We prove that definable ring topologies on NIP fields are closely connected to NIP integral domains. More precisely, we show that up to elementary equivalence, any NIP topological field arises from an NIP integral domain. As an application,…

Let f be a polinomial with coefficients in a finite field F. Let $\Psi : F \to C^{\ast}$ be a non-trivial additive character. In this paper we give bounds for the exponential sums $\sum_{x\in F^n} \Psi (Tr_{F/F_p} (f(x)))$ in some cases…

Mixture models are one of the most widely used statistical tools when dealing with data from heterogeneous populations. This paper considers the long-standing debate over finite mixture and infinite mixtures and brings the two modelling…

Let $(X,d,f)$ be a dynamical system, where $(X,d)$ is a compact metric space and $f:X\rightarrow X$ is a continuous map. Using the concepts of \textit{g-almost product property} and \textit{uniform separation property} introduced by Pfister…

The Ramsey Choice principle for families of $n$-element sets, denoted $\mathrm{RC}_n$, states that every infinite set $X$ has an infinite subset $Y\subseteq X$ with a choice function on $[Y]^n := \{z\subseteq Y : |z| = n\}$. We investigate…

The Mapper produces a compact summary of high dimensional data as a simplicial complex. We study the problem of quantifying the interestingness of subpopulations in a Mapper, which appear as long paths, flares, or loops. First, we create a…

The iterative scaling procedure (ISP) is an algorithm which computes a sequence of matrices, starting from some given matrix. The objective is to find a matrix 'proportional' to the given matrix, having given row and column sums. In many…

For a polynomial $P$ of degree $n$ and an $m$-tuple $\Lambda=(\lambda_1,\dots,\lambda_m)$ of distinct complex numbers, the dope matrix of $P$ with respect to $\Lambda$ is $D_P(\Lambda)=(\delta_{ij})_{i\in [1,m],j\in[0,n]}$, where…

Literature considers under the name \emph{unimaginable numbers} any positive integer going beyond any physical application, with this being more of a vague description of what we are talking about rather than an actual mathematical…

In the parlance of relational structures, the Finite Ramsey Theorem states that the class of all finite chains has the Ramsey property. A classical result of J. Ne\v{s}et\v{r}il and V. R\"{o}dl claims that the class of all finite posets…

Ramsey Theorem [6] for pairs is intuitionistically but not classically provable: it is equivalent to a subclassical principle [2]. In this note we show that Ramsey may be restated in an intuitionistically provable form, which is informative…