Related papers: Bounding finite-image sequences of length $\omega^…

In this paper, we consider the construction of linear lexicodes over finite chain rings by using a $B$-ordering over these rings and a selection criterion. % and a greedy Algorithm. As examples we give lexicodes over $\mathbb{Z}_4$ and…

Let f(t,X) be an irreducible polynomial over the field of rational functions k(t), where k is a number field. Let O be the ring of integers of k. Hilbert's irreducibility theorem gives infinitely many integral specializations of t to values…

In our previous work we conjectured - inspired by an algebro-geometric result of Fujita - that the height of an arithmetic Fano variety X of relative dimension $n$ is maximal when X is the projective space $\mathbb{P}^n_{\mathbb{Z}}$ over…

We prove a quantitative version of the curve selection lemma. Denoting by $s,d,k$ a bound on the number, the degree and the number of variables of the polynomials describing a semi-algebraic set $S$ and a point $x$ in $\bar S$, we find a…

Since K\H{o}v\'ari, S\'os, and Tur\'an proved upper bounds for the Zarankiewicz problem in 1954, much work has been undertaken to improve these bounds, and some have done so by restricting to particular classes of graphs. In 2017, Fox,…

We present a new approximation algorithm for the treewidth problem which finds an upper bound on the treewidth and constructs a corresponding tree decomposition as well. Our algorithm is a faster variation of Reed's classical algorithm. For…

Let $X_1, X_2, ..., X_n, ... $ be a sequence of iid random variables with values in a finite alphabet $\{1,...,m\}$. Let $LI_n$ be the length of the longest increasing subsequence of $X_1, X_2, ..., X_n.$ We express the limiting…

This work provides the general framework for obtaining strong Szeg\H{o} limit theorems for multi-bordered, semi-framed, framed, and multi-framed Toeplitz determinants, extending the results of Basor et al. (2022) beyond the (single)…

We prove an analogue of the classical Erd\H{o}s-Ko-Rado theorem for intersecting sets of permutations in finite 2-transitive groups. Given a finite group G acting faithfully and 2-transitively on the set X, we show that an intersecting set…

Given a graph $G=(V, E)$ and a positive integer $k$, in Maximum $k$-Order Bounded Component Set (Max-$k$-OBCS), it is required to find a vertex set $S \subseteq V$ of maximum size such that each component in the induced graph $G[S]$ has at…

We consider certain strengthenings of property (T) relative to Banach spaces that are satisfied by high rank Lie groups. Let X be a Banach space for which, for all k, the Banach--Mazur distance to a Hilbert space of all k-dimensional…

We introduce a containment relation of hypergraphs which respects linear orderings of vertices and investigate associated extremal functions. We extend, by means of a more generally applicable theorem, the n.log n upper bound on the ordered…

We show that a subset of $\mathbb{F}_{p}^{n}$ of $\mathrm{VC_{2}}$-dimension at most $k$ is well approximated by a union of atoms of a quadratic factor of complexity $(\ell,q)$ (denoting the complexities of the linear and quadratic part,…

The focus of this paper is two fold. Firstly, we present a logical approach to graph modification problems such as minimum node deletion, edge deletion, edge augmentation problems by expressing them as an expression in first order (FO)…

This paper is the first in a series of three, about (relatively)free profinite semigroups and S-adic representations of minimal shift spaces. We associate to each primitive S-adic directivesequence ${\boldsymbol{\sigma}}$ a…

We investigate the sample complexity of networks with bounds on the magnitude of its weights. In particular, we consider the class \[ H=\left\{W_t\circ\rho\circ \ldots\circ\rho\circ W_{1} :W_1,\ldots,W_{t-1}\in M_{d, d}, W_t\in…

We prove near-optimal trade-offs for quantifier depth versus number of variables in first-order logic by exhibiting pairs of $n$-element structures that can be distinguished by a $k$-variable first-order sentence but where every such…

We prove that there exists a bivariate function f with f(k,l) = O(l k log k) such that for every naturals k and l, every graph G has at least k vertex-disjoint cycles of length at least l or a set of at most f(k,l) vertices that meets all…

We give a new proof of the completeness of the space $\mathcal{O}_C$ by applying a criterion of compact regularity for the isomorphic sequence space $\lim_{k\rightarrow} (s\hat \otimes (\ell^\infty)_{-k})$. Along the way we show that the…

Let $f : X \to S$ be a family of smooth projective algebraic varieties over a smooth connected base $S$, with everything defined over $\overline{\mathbb{Q}}$. Denote by $\mathbb{V} = R^{2i} f_{*} \mathbb{Z}(i)$ the associated integral…