English
Related papers

Related papers: Selections Without Adjacency on a Rectangular Grid

200 papers

New results on pentagonal geometries PENT(k,r) with block sizes k = 3 or k = 4 are given. In particular we completely determine the existence spectra for PENT(3,r) systems with the maximum number of opposite line pairs as well as those…

Combinatorics · Mathematics 2020-07-22 Anthony D. Forbes , Terry S. Griggs , Klara Stokes

We describe and prove correctness of two practical algorithms for finding indecomposable summands of finitely generated modules over a finitely generated k-algebra R. The first algorithm applies in the (multi)graded case, which enables the…

Commutative Algebra · Mathematics 2026-05-28 Devlin Mallory , Mahrud Sayrafi

Consider an arrangement of $k$ lines intersecting the unit square. There is some minimum scaling factor so that any placement of a rectangle with aspect ratio $1 \times p$ with $p\geq 1$ must non-transversely intersect some portion of the…

Computational Geometry · Computer Science 2022-01-05 Bradley McCoy , Eli Quist , Anna Schenfisch

In this paper, we present an algorithm which allows us to search for all the bisections for the binomial coefficients $\{\binom{n}{k} \}_{k=0,...,n}$ and include a table with the results for all $n\le 154$. Connections with previous work on…

Combinatorics · Mathematics 2018-03-28 Eugen J. Ionascu

Let $A$ be a unital associative ring and let $T^{(k)}$ be the two-sided ideal of $A$ generated by all commutators $[a_1, a_2, \dots , a_k]$ $(a_i \in A)$ where $[a_1, a_2] = a_1 a_2 - a_2 a_1$, $[a_1, \dots , a_{k-1}, a_k] = \bigl[ [a_1,…

Rings and Algebras · Mathematics 2019-04-09 Galina Deryabina , Alexei Krasilnikov

Let L be a simple Euclidean arrangement of n pseudolines. It is shown that if L has exactly one (>=5)=gon P, and k is the number of edges of P that are adjacent to an unbounded cell of the subarrangement of L induced by the pseudolines in…

Combinatorics · Mathematics 2010-08-30 Jesus Leaños , Mbe Koua Christophe Ndjatchi , Luis Manuel Rivera-Martinez

We prove that with high probability $G(n,p)$ with $p \geq n^{-4/11 + o(1)}$ admits a fractional triangle decomposition (FTD), i.e., a nonnegative weighting of its triangles such that for each edge, the total weight of the triangles…

Combinatorics · Mathematics 2025-11-21 Ghaura Mahabaduge , Michael Simkin

Let $K$ be a number field of degree $d\geq 3$ and fix $s$ multiplicatively independent algebraic integers $\gamma_1, \dots, \gamma_s \in K^*$ that fulfil some technical requirements, which can be vastly simplified to $\mathbb{Q}$-linearly…

Number Theory · Mathematics 2023-01-30 Tobias Hilgart , Volker Ziegler

Recently, Drema and Saikia (2023) proved several congruences modulo powers of 2 and 3 for overpartition triples with odd parts. We extend their list substantially. We prove several congruences modulo powers of 2 for overpartition k-tuples…

Number Theory · Mathematics 2024-08-23 Manjil P. Saikia , Abhishek Sarma , James A. Sellers

A new tur\'an-type problem on distances on graphs was introduced by Tyomkyn and Uzzell. In this paper, we focus on the case that the distance is two. We primely show that for any value of $n$, a graph on $n$ vertices without three vertices…

Combinatorics · Mathematics 2013-12-05 Xueliang Li , Jing Ma , Yongtang Shi , Jun Yue

In the paper the foundation of the $k$-orbit theory is developed. The theory opens a new simple way to the investigation of groups and multidimensional symmetries. The relations between combinatorial symmetry properties of a $k$-orbit and…

General Mathematics · Mathematics 2007-05-23 Aleksandr Golubchik

For positive integers $n>k$, let $P_{n,k}(x)=\displaystyle\sum_{j=0}^k \binom{n}{j}x^j $ be the polynomial obtained by truncating the binomial expansion of $(1+x)^n$ at the $k^{th}$ stage. These polynomials arose in the investigation of…

Number Theory · Mathematics 2013-06-05 Sudesh K. Khanduja , Ramneek Khassa , Shanta Laishram

Let $T_m(N,2k)$ denote the $m$-th Hecke operator on the space $S_{2k}(\Gamma_0(N))$ of cuspidal modular forms of weight $2k$ and level $N$. In this paper, we study the non-repetition of the second coefficient of the characteristic…

Number Theory · Mathematics 2025-06-04 Archer Clayton , Helen Dai , Tianyu Ni , Erick Ross , Hui Xue , Jake Zummo

In this paper we enumerate $k$-noncrossing tangled-diagrams. A tangled-diagram is a labeled graph whose vertices are $1,...,n$ have degree $\le 2$, and are arranged in increasing order in a horizontal line. Its arcs are drawn in the upper…

Combinatorics · Mathematics 2008-02-26 William Y. C. Chen , Jing Qin , Christian M. Reidys , Doron Zeilberger

We study a constrained version of the knapsack problem in which dependencies between items are given by the adjacencies of a graph. In the 1-neighbour knapsack problem, an item can be selected only if at least one of its neighbours is also…

Data Structures and Algorithms · Computer Science 2011-09-28 Glencora Borradaile , Brent Heeringa , Gordon Wilfong

We construct a formula $\phi$ which axiomatizes non-narrow rectangular grids without using any binary relations other than the grid neighborship relations. As a corollary, we prove that a set $A \subseteq \mathbb{N}$ is a spectrum of a…

Logic in Computer Science · Computer Science 2019-12-23 Eryk Kopczynski

Let $B$ be the set of odd integers that are sums of two coprime squares. We prove that the trigonometric polynomial $S(\alpha;N)=\sum_{b\in B,b\leq N} e(b\alpha)$ satisfies \[ \frac{S(\alpha; N)}{N/\sqrt{\log N}}<<_{A,A'} \frac{1}{\phi(q)}…

Number Theory · Mathematics 2025-09-30 Olivier Ramare , GK Viswanadham

We obtain the decomposition of the tensor space $\mathfrak{sl}_n^{\otimes k}$ as a module for $\mathfrak{sl}_n$, find an explicit formula for the multiplicities of its irreducible summands, and (when $n \ge 2k$) describe the centralizer…

Representation Theory · Mathematics 2007-05-23 Georgia Benkart , Stephen Doty

This article studies separating invariants for the ring of multisymmetric polynomials in $m$ sets of $n$ variables over an arbitrary field $\mathbb{K}$. We prove that in order to obtain separating sets it is enough to consider polynomials…

Representation Theory · Mathematics 2021-11-16 Artem Lopatin , Fabian Reimers

We consider the number of partitions of $n$ whose Young diagrams fit inside an $m \times \ell$ rectangle; equivalently, we study the coefficients of the $q$-binomial coefficient $\binom{m+\ell}{m}_q$. We obtain sharp asymptotics throughout…

Combinatorics · Mathematics 2019-02-05 Stephen Melczer , Greta Panova , Robin Pemantle