English
Related papers

Related papers: Bounds for orthogonal arrays with repeated rows

200 papers

Strict partitions are enumerated with respect to the weight, the number of parts, and the number of sequences of odd length. We write this trivariate generating function as a double sum $q$-series. Equipped with such a combinatorial set-up,…

Combinatorics · Mathematics 2024-10-15 Shishuo Fu , Haijun Li

Inspired by the recent work by Nadji, Ahmia and Ram\'irez, we examined the arithmetic properties of $\bar{B}_{l_1,l_2} (n)$, the number of overpartitions of n whose parts are neither divisible by $l_1$ nor divisible by $l_2$. In particular,…

Number Theory · Mathematics 2025-07-04 Anakha V

Let a sequence $(P_n)$ of polynomials in one complex variable satisfy a recurre ce relation with length growing slowlier than linearly. It is shown that $(P_n) $ is an orthonormal basis in $L^2_{\mu}$ for some measure $\mu$ on $\C$, if and…

Functional Analysis · Mathematics 2007-05-23 D. P. L. Castrigiano , W. Klopfer

We study two families of orthogonal polynomials. The first is a finite family related to the Askey-Wilson polynomials but the orthogonality is on the real line. A limiting case of this family is an infinite system of orthogonal polynomials…

Classical Analysis and ODEs · Mathematics 2022-05-12 Mourad E. H. Ismail , Ruiming Zhang , Keru Zhou

We define strict and lax orthogonal factorization systems on double categories. These consist of an orthogonal factorization system on arrows and one on double cells that are compatible with each other. Our definitions are motivated by…

We present improved upper bounds on the spanning ratio of constrained $\theta$-graphs with at least 6 cones and constrained Yao-graphs with 5 or at least 7 cones. Given a set of points in the plane, a Yao-graph partitions the plane around…

Computational Geometry · Computer Science 2019-04-08 Prosenjit Bose , André van Renssen

We propose a novel method for the construction of orthogonal arrays. The algorithm makes use of the Kronecker Product operator in association with unit column vectors to generate new orthogonal arrays from existing orthogonal arrays. The…

Discrete Mathematics · Computer Science 2012-10-26 Ankit Pat

This paper concerns random bipartite planar maps which are defined by assigning weights to their faces. The paper presents a threefold contribution to the theory. Firstly, we prove the existence of the local limit for all choices of weights…

Probability · Mathematics 2014-09-11 Jakob E. Björnberg , Sigurdur Orn Stefansson

The purpose of this present paper is to investigate the geometric structure of regular overdetermined systems of second order with two independent and one dependent variables from the point of view of rank 2 prolongations. Utilizing this…

Differential Geometry · Mathematics 2012-10-19 Takahiro Noda

Orthogonal polynomials on quadratic curves in the plane are studied. These include orthogonal polynomials on ellipses, parabolas, hyperbolas, and two lines. For an integral with respect to an appropriate weight function defined on any…

Numerical Analysis · Mathematics 2020-01-03 Sheehan Olver , Yuan Xu

Consider a linear ordering equipped with a finite sequence of monadic predicates. If the ordering contains an interval of order type \omega or -\omega, and the monadic second-order theory of the combined structure is decidable, there exists…

Logic in Computer Science · Computer Science 2015-07-01 Alexis Bes , Alexander Rabinovich

Let $P$ be a convex $d$-polytope and $0 \leq k \leq d-1$. In 2023, this author proved the following inequalities, resolving a question of B\'ar\'any: \[ \frac{f_k(P)}{f_0(P)} \geq \frac{1}{2}\biggl[{\lceil \frac{d}{2} \rceil \choose k} +…

Combinatorics · Mathematics 2024-01-30 Joshua Hinman

Let $f\in \mathbb{R}[x_1,\ldots, x_k]$, for $k\ge 2$. For any finite sets $A_1,\ldots, A_k\subset \mathbb{R}$, consider the set $$ f(A_1,\ldots, A_k):=\{f(a_1,\ldots, a_k)\mid (a_1,\cdots,a_k)\in A_1\times\cdots \times A_k\}, $$ that is,…

Combinatorics · Mathematics 2025-11-07 Yaara Jahn , Orit E. Raz

We use the octahedron recurrence to give a simplified statement and proof of a formula for iterated birational rowmotion on a product of two chains, first described by Musiker and Roby. Using this, we show that weights of certain chains in…

Combinatorics · Mathematics 2022-04-12 Joseph Johnson , Ricky Ini Liu

We prove a martingale triangular array generalization of the Chow-Birnbaum-Marshall's inequality. The result is used to derive a strong law of large numbers for martingale triangular arrays whose rows are asymptotically stable in a certain…

Probability · Mathematics 2009-05-19 Yves F. Atchade

The main purpose of this survey is to gather results on the boundedness of the Bergman projection. First, we shall go over some equivalent norms on weighted Bergman spaces $A^p_\omega$ which are useful in the study of this question. In…

Complex Variables · Mathematics 2015-01-19 José Ángel Peláez , Jouni Rättyä

It is shown that every $n$-vertex graph that admits a 2-bend RAC drawing in the plane, where the edges are polylines with two bends per edge and any pair of edges can only cross at a right angle, has at most $20n-24$ edges for $n\geq 3$.…

Discrete Mathematics · Computer Science 2024-11-05 Csaba D. Tóth

In this paper, we construct four infinite families of binary linear codes associated with double cosets with respect to certain maximal parabolic subgroup of the orthogonal group O^+(2n,2^r). Here q is a power of two. Then we obtain two…

Number Theory · Mathematics 2009-07-24 Dae San Kim

We investigate integer numbers which possess at the same time the properties to be triangulars and squares, that are, numbers $a$ for which do exist integers $m$ and $n$ such that $ a = n^2 = \frac{m \cdot (m+1)}{2} $. In particular, we are…

Number Theory · Mathematics 2017-03-21 Fabio Roman

Nine new 2-D OOCs are presented here, all sharing the common feature of a code size that is much larger in relation to the number of time slots than those of constructions appearing previously in the literature. Each of these constructions…

Information Theory · Computer Science 2009-11-03 Reza Omrani , Gagan Garg , P. Vijay Kumar , Petros Elia , Pankaj Bhambhani