English
Related papers

Related papers: Linear $(2,p,p)$-AONTs do Exist

200 papers

Jaclyn Anderson proved that if s and t are relatively prime positive integers, then there are exactly (s+t-1)!/(s!t!) partitions whose set of hook-lengths is disjoint from the set {s,t}. Drew Armstrong conjectured (and Paul Johnson, and a…

Combinatorics · Mathematics 2015-09-03 Shalosh B. Ekhad , Doron Zeilberger

A pentagonal geometry PENT($k$, $r$) is a partial linear space, where every line, or block, is incident with $k$ points, every point is incident with $r$ lines, and for each point $x$, there is a line incident with precisely those points…

Combinatorics · Mathematics 2020-07-28 Anthony D. Forbes

Given an infinite-dimensional Banach space $X$ and a Banach space $Y$ with no finite cotype, we determine whether or not every continuous linear operator from $X$ to $Y$ is absolutely $(q;p)$-summing for almost all choices of $p$ and $q$,…

Functional Analysis · Mathematics 2015-10-06 Geraldo Botelho , Daniel Pellegrino

A PSCA$(v, t, \lambda)$ is a multiset of permutations of the $v$-element alphabet $\{0, \dots, v-1\}$ such that every sequence of $t$ distinct elements of the alphabet appears in the specified order in exactly $\lambda$ of the permutations.…

Combinatorics · Mathematics 2023-08-30 Aidan R. Gentle , Ian M. Wanless

Let $n, k$ and $a$ be positive integers. The Stirling numbers of the first kind, denoted by $s(n,k)$, count the number of permutations of $n$ elements with $k$ disjoint cycles. Let $p$ be a prime. In recent years, Lengyel, Komatsu and…

Number Theory · Mathematics 2020-03-03 Shaofang Hong , Min Qiu

In the short note we prove that for every $0<p<1$, there exists an infinite dimensional closed linear subspace of $\mathcal{L}\left( \ell_{p};\ell_{p}\right) $ every nonzero element of which is non $(r,s)$-absolutely summing operator for…

Functional Analysis · Mathematics 2019-02-27 Daniel Tomaz

We study the following fundamental realization problem of directed acyclic graphs (dags). Given a sequence S:=(a_1,b_1),...,(a_n, b_n) with a_i, b_i in Z_0^+, does there exist a dag (no parallel arcs allowed) with labeled vertex set V:=…

Data Structures and Algorithms · Computer Science 2012-03-19 Annabell Berger , Matthias Müller-Hannemann

In this paper, we prove existence of $L^p$-optimal transport maps with $p \in (1,\infty)$ in a class of branching metric spaces defined on $\mathbb{R}^N$. In particular, we introduce the notion of cylinder-like convex function and we prove…

Metric Geometry · Mathematics 2024-10-31 Guoxi Liu , Mattia Magnabosco , Yicheng Xia

Let S(n,k) denote the Stirling numbers of the second kind. We prove that the p-adic limit of S(p^e a + c, p^e b + d) as e goes to infinity exists for all integers a, b, c, and d. We call the limiting p-adic integer S(p^\infty a + c,…

Number Theory · Mathematics 2013-07-30 Donald M. Davis

A circulant nut graph is a non-trivial simple graph such that its adjacency matrix is a circulant matrix whose null space is spanned by a single vector without zero elements. Regarding these graphs, the order-degree existence problem can be…

Combinatorics · Mathematics 2025-06-09 Ivan Damnjanović

We start by considering binary words containing the minimum possible numbers of squares and antisquares (where an antisquare is a word of the form $x \overline{x}$), and we completely classify which possibilities can occur. We consider…

Formal Languages and Automata Theory · Computer Science 2019-04-22 Tim Ng , Pascal Ochem , Narad Rampersad , Jeffrey Shallit

We prove the following results regarding the linear solvability of networks over various alphabets. For any network, the following are equivalent: (i) vector linear solvability over some finite field, (ii) scalar linear solvability over…

Information Theory · Computer Science 2018-01-31 Joseph Connelly , Kenneth Zeger

This paper explores a common class of diagonal-norm summation by parts (SBP) operators found in the literature, which can be parameterized by an integer triple $(s,t,r)$ representing the interior order of accuracy ($2s)$, the boundary order…

Numerical Analysis · Mathematics 2016-08-22 Nathan Albin , Joshua Klarmann

An $(n,r,s)$-system is an $r$-uniform hypergraph on $n$ vertices such that every pair of edges has an intersection of size less than $s$. Using probabilistic arguments, R\"{o}dl and \v{S}i\v{n}ajov\'{a} showed that for all fixed integers…

Combinatorics · Mathematics 2021-06-11 Xizhi Liu , Dhruv Mubayi

Let $L^{s,p}(\mathbb{R}^n)$ denote the homogeneous Sobolev-Slobodeckij space. In this paper, we demonstrate the existence of a bounded linear extension operator from the jet space $J^{\lfloor s \rfloor}_E L^{s,p}(\mathbb{R}^n)$ to…

Classical Analysis and ODEs · Mathematics 2024-10-11 Han Li

Let p and n be positive integers with p>1, and let E(p,n) be the oriented 3-manifold obtained by performing pn(p-1)-1 surgery on a positive torus knot of type (p, pn+1). We prove that E(2,n) does not carry tight contact structures for any…

Symplectic Geometry · Mathematics 2007-05-23 Paolo Lisca , Andras I. Stipsicz

Let $A_{s,k}(m)$ be the maximum number of distinct letters in any sequence which can be partitioned into $m$ contiguous blocks of pairwise distinct letters, has at least $k$ occurrences of every letter, and has no subsequence forming an…

Combinatorics · Mathematics 2014-09-23 Jesse Geneson

An $\epsilon$-net theorem for a hypergraph upper bounds the minimum size of a vertex set that pierces all $\epsilon$-heavy hyperedges. A $(p,2)$-theorem bounds from above the minimum size of a vertex set that pierces all hyperedges, in…

Combinatorics · Mathematics 2026-01-05 Chaya Keller , Shakhar Smorodinsky

The termination problem for affine programs over the integers was left open in\cite{Braverman}. For more that a decade, it has been considered and cited as a challenging open problem. To the best of our knowledge, we present here the most…

Discrete Mathematics · Computer Science 2014-09-19 Rachid Rebiha , Arnaldo Vieira Moura , Nadir Matringe

In this paper, we study prime order automorphisms of generalized quadrangles. We show that, if $\mathcal{Q}$ is a thick generalized quadrangle of order $(s,t)$, where $s > t$ and $s+1$ is prime, and $\mathcal{Q}$ has an automorphism of…

Combinatorics · Mathematics 2018-09-18 Santana F. Afton , Eric Swartz