Related papers: Some results on generalized strong external differ…

In this paper, we study the generalized gapped k-mer filters and derive a closed form solution for their coefficients. We consider nonnegative integers $\ell$ and $k$, with $k\leq \ell$, and an $\ell$-tuple $B=(b_1,\ldots,b_{\ell})$ of…

The main purpose of this note is to establish an effective version of the Grunwald--Wang Theorem, which asserts that given a family of local characters $\chi^{v}$ of $K_{v}^{*}$ of exponent $m$ where $v \in S$ for a finite set $S$ of primes…

Let k be an integer and k \geq 3. A graph G is k-chordal if G does not have an induced cycle of length greater than k. From the definition it is clear that 3-chordal graphs are precisely the class of chordal graphs. Duchet proved that, for…

A group divisible design $\mbox{GDD}(m,n;\lambda_1,\lambda_2)$, is an ordered pair $(V, \cal{B})$ where $V$ is an $(m+n)$-set of symbols while $\cal{B}$ is a collection of $3$-subsets (called blocks) of $V$ satisfying the following…

In this paper we prove the case $dim(V_3)=3$ of a conjecture about the exterior operad ${\Lambda}^{S^2}_{V_d}$. For this we introduce a collection of natural involutions on the set of homogeneous cycle-free $d$-partitions of the complete…

Let $G$ be a simple graph. The $k$-th neighborhood of a vertex subset $S \subseteq V(G)$, denoted $\Lambda^k(S)$, is the set of vertices that are adjacent to at least $k$ vertices in $S$. The $k$-th binding number $\beta^k(G)$ is defined as…

We propose a recipe on how to build a general, powerful, scalable (GPS) graph Transformer with linear complexity and state-of-the-art results on a diverse set of benchmarks. Graph Transformers (GTs) have gained popularity in the field of…

A Gelfand triplet for the Hamiltonian H of the Friedrichs model on R with finite-dimensional multiplicity space K, is constructed such that exactly the resonances (poles of the inverse of the Livsic-matrix) are (generalized) eigenvalues of…

For fixed positive integers $n$ and $k$, the Kneser graph $KG_{n,k}$ has vertices labeled by $k$-element subsets of $\{1,2,\dots,n\}$ and edges between disjoint sets. Keeping $k$ fixed and allowing $n$ to grow, one obtains a family of…

We generalize the Giveon-Kutasov duality for the 3d $\mathcal{N}=3$ $U(N)_{k,k+nN}$ Chern-Simons matter gauge theory with $F$ fundamental hypermultiplets by introducing $SU(N)$ and $U(1)$ Chern-Simons levels differently. We study the…

In this paper, we provide a mathematical framework for characterizing AMD codes that are R-optimal. We introduce a new combinatorial object, the reciprocally-weighted external difference family (RWEDF), which corresponds precisely to an…

Motivated by analogous questions in the setting of Steiner triple systems and Latin squares, Nenadov, Sudakov and Wagner [Completion and deficiency problems, Journal of Combinatorial Theory Series B, 2020] recently introduced the notion of…

We show that general moving enough families of high enough degree hypersurfaces in a complex projective space do not have a dominant set of sections.

In a recent work (ECCC, TR18-171, 2018), we introduced models of testing graph properties in which, in addition to answers to the usual graph-queries, the tester obtains {\em random vertices drawn according to an arbitrary distribution…

We present a new nonempirical density functional generalized gradient approximation (GGA) that gives significant improvements for lattice constants, crystal structures, and metal surface energies over the most popular Perdew-Burke-Ernzerhof…

We introduce a method to embed edge-colored graphs into families of expander graphs, which generalizes a framework developed by Dragani\'c, Krivelevich, and Nenadov (2022). As an application, we show that each family of sufficiently…

The celebrated {Erd\H{o}s-Ko-Rado} Theorem states that for $n \geq 2k$ a family $\mathscr{F}$ of $k$ subsets of $[n]$ for which each pair of members of $\mathscr{F}$ have a non-empty intersection has size at most $\binom{n-1}{k-1}$ and for…

Let $F_k$ be the set of graphs on $k$ vertices. For a graph $G$, a $k$-decomposition is a set of induced subgraphs of $G$, each isomorphic to an element of $F_k$, such that each pair of vertices of $G$ is in exactly one element of the set.…

Degenerate modules of the exceptional infinite-dimensional simple Lie superalgebras vle(3|6), ksle(5|10) and mb(3|8) have recently been constructed by Kac and Rudakov, and by Grozman, Leites and Shchepochkina. I rederive their results using…

A graph $G = (V,E)$ is globally rigid in $\mathbb{R}^d$ if for any generic placement $p : V \rightarrow \mathbb{R}^d$ of the vertices, the edge lengths $||p(u) - p(v)||, uv \in E$ uniquely determine $p$, up to congruence. In this paper we…