相关论文: Three Generalizations of Davenport-Schinzel Sequen…

Given a lower envelope in the form of an arbitrary sequence $u$, let $LSP(u, d)$ denote the maximum length of any subsequence of $u$ that can be realized as the lower envelope of a set of polynomials of degree at most $d$. Let $sp(m, d)$…

In this work we study $S$-adic shifts generated by sequences of morphisms that are constant-length. We call a sequence of constant-length morphisms torsion-free if any prime divisor of one of the lengths is a divisor of infinitely many of…

We obtain new lower and upper bounds for the maximum multiplicity of some weighted and, respectively, non-weighted common geometric graphs drawn on n points in the plane in general position (with no three points collinear): perfect…

It is well known that, when normalized by n, the expected length of a longest common subsequence of d sequences of length n over an alphabet of size sigma converges to a constant gamma_{sigma,d}. We disprove a speculation by Steele…

Let $G$ be a finite group multiplicatively written. The small Davenport constant of $G$ is the maximum positive integer ${\sf d}(G)$ such that there exists a sequence $S$ of length ${\sf d}(G)$ for which every subsequence of $S$ is…

For a sequence $S$ over a finite abelian group, let $MZ(S)$ denote the length of the shortest nonempty zero-sum subsequence of $S$. We prove that if $G$ is finite abelian of order $n$ and $S$ has length $n$, then $MZ(S)\le n-|\supp(S)|+1$.…

Deep neural networks (DNNs) have significantly advanced machine learning, with model depth playing a central role in their successes. The dynamical system modeling approach has recently emerged as a powerful framework, offering new…

We provide upper and lower bounds for the length of controlled bad sequences over the majoring and the minoring orderings of finite sets of $\mathbb{N}^d$. The results are obtained by bounding the length of such sequences by functions from…

In this paper we study some basic properties of rough $I$-convergent double sequences in the line of D$\ddot{u}$ndar [8]. We also study the set of all rough $I$-limits of a double sequence and relation between boundedness and rough…

This paper studies generalization error bounds for Transformer models. Based on the offset Rademacher complexity, we derive sharper generalization bounds for different Transformer architectures, including single-layer single-head,…

We obtain sharp lower and upper bounds for the number of maximal (under inclusion) independent sets in trees with fixed number of vertices and diameter. All extremal trees are described up to isomorphism.

Let $G = C_{n_1} \oplus ... \oplus C_{n_r}$ with $1 < n_1 \t ... \t n_r$ be a finite abelian group, $\mathsf d^* (G) = n_1 + ... + n_r - r$, and let $\mathsf d (G)$ denote the maximal length of a zero-sum free sequence over $G$. Then…

Upper bounds on the maximum number of codewords in a binary code of a given length and minimum Hamming distance are considered. New bounds are derived by a combination of linear programming and counting arguments. Some of these bounds…

We study pattern densities in binary sequences, finding optimal limit sequences with fixed pattern densities.

A sequence of generalizations of Cartan's conservation of torsion theorem is given for n-dimensional differentiable manifolds having a general linear connection.

In this manuscript, we study the learning of deep attention neural networks, defined as the composition of multiple self-attention layers, with tied and low-rank weights. We first establish a mapping of such models to sequence multi-index…

Recently, generalizations of the classical Three Gap Theorem to higher dimensions attracted a lot of attention. In particular, upper bounds for the number of nearest neighbor distances have been established for the Euclidean and the maximum…

In 2004, J.C. Tong found bounds for the approximation quality of a regular continued fraction convergent of a rational number, expressed in bounds for both the previous and next approximation. We sharpen his results with a geometric method…

We introduce a new class of problems lying halfway between questions about graph capacity and intersection. We say that two binary sequences x and y of the same length have a skewincidence if there is a coordinate i for which x_i=y_{i+1}=1…

We define two new families of polynomials that generalize permanents and prove upper and lower bounds on their determinantal complexities comparable to the known bounds for permanents. One of these families is obtained by replacing…