English
Related papers

Related papers: Constructions and uses of incomplete pairwise bala…

200 papers

Given an integer $k\ge3$ and a group $G$ of odd order, if there exists a $2$-$(v,k,1)$-design and if $v$ is sufficiently large, then there is such a design whose automorphism group has a subgroup isomorphic to $G$. A weaker result is proved…

Combinatorics · Mathematics 2021-03-24 William M. Kantor

Signed difference sets have interesting applications in communications and coding theory. A $(v,k,\lambda)$-difference set in a finite group $G$ of order $v$ is a subset $D$ of $G$ with $k$ distinct elements such that the expressions…

Combinatorics · Mathematics 2023-06-12 Zhiwen He , Tingting Chen , Gennian Ge

Multicriteria Decision Making problems are important both for individuals and groups. Pairwise comparisons have become popular in the theory and practice of preference modelling and quantification. We focus on decision problems where the…

Discrete Mathematics · Computer Science 2025-09-04 Sándor Bozóki , Zsombor Szádoczki , Hailemariam Abebe Tekile

An incidence structure consists simply of a set P of points and a set B of blocks, with a relation of incidence between points and blocks.A symmetric (v,k,\lambda) block design is the subject of this paper. The symmetric (n^2+n+1, n+1,1)…

General Mathematics · Mathematics 2017-09-14 Mingchun Xu

A Ryser design $\mathcal{D}$ on $v$ points is a collection of $v$ proper subsets (called blocks) of a point-set with $v$ points satisfying (i) every two blocks intersect each other in $\lambda$ points for a fixed $\lambda < v$ (ii) there…

Combinatorics · Mathematics 2019-09-16 Tushar D. Parulekar , Sharad S. Sane

We study disjunctive conic sets involving a general regular (closed, convex, full dimensional, and pointed) cone K such as the nonnegative orthant, the Lorentz cone or the positive semidefinite cone. In a unified framework, we introduce…

Optimization and Control · Mathematics 2015-04-02 Fatma Kılınç-Karzan

We propose an enhancement to Benders decomposition (BD) that generates valid inequalities for the convex hull of the Benders reformulation, addressing the limitation that classical BD cuts are typically tight only for the continuous…

Optimization and Control · Mathematics 2026-05-19 Kaiwen Fang , Inho Sin , Geunyeong Byeon

We say that a linear space is harmonious if it is resolvable and admits an automorphism group acting sharply transitively on the points and transitively on the parallel classes. Generalizing old results by the first author et al. we present…

Combinatorics · Mathematics 2023-03-22 Marco Buratti , Dieter Jungnickel

Compared with co-prime integers, co-prime integer matrices are more challenging due to the non-commutativity. In this paper, we present a new family of pairwise co-prime integer matrices of any dimension and large size. These matrices are…

Signal Processing · Electrical Eng. & Systems 2025-04-14 Guangpu Guo , Xiang-Gen Xia

Detecting edges in images suffers from the problems of (P1) heavy imbalance between positive and negative classes as well as (P2) label uncertainty owing to disagreement between different annotators. Existing solutions address P1 using…

Computer Vision and Pattern Recognition · Computer Science 2024-03-08 Bedrettin Cetinkaya , Sinan Kalkan , Emre Akbas

This paper proposes a framework to assess the stability of an ordinary differential equation which is coupled to a 1D-partial differential equation (PDE). The stability theorem is based on a new result on Integral Quadratic Constraints…

Optimization and Control · Mathematics 2026-03-03 Matthieu Barreau , Carsten W. Scherer , Frederic Gouaisbaut , Alexandre Seuret

This paper examines the use of Lie group and Lie Algebra theory to construct the geometry of pairwise comparisons matrices. The Hadamard product (also known as coordinatewise, coordinate-wise, elementwise, or element-wise product) is…

General Mathematics · Mathematics 2021-05-24 W. W. Koczkodaj , V. W. Marek , Y. Yayli

We consider the problem of constructing small coresets for $k$-Median in Euclidean spaces. Given a large set of data points $P\subset \mathbb{R}^d$, a coreset is a much smaller set $S\subset \mathbb{R}^d$, so that the $k$-Median costs of…

Data Structures and Algorithms · Computer Science 2023-02-28 Lingxiao Huang , Ruiyuan Huang , Zengfeng Huang , Xuan Wu

A \textbf{double-change covering design} (DCCD) is a $v$-set $V$ and an ordered list $\mathcal{L}$ of $b$ blocks of size $k$ where every pair from $V$ must occur in at least one block and each pair of consecutive blocks differs by exactly…

Combinatorics · Mathematics 2025-11-04 Amanda Lynn Chafee , Brett Stevens

We construct many irreducible polynomials within semigroups generated by sets of the form $S=\{x^2+c_1,\dots,x^2+c_s\}$ under composition.

Number Theory · Mathematics 2022-08-09 Wade Hindes , Reiyah Jacobs , Peter Ye

While colloids are promising building blocks for the self-assembly of materials with novel microstructures, their numerous tunable parameters inhibit brute force searching for appropriate parameter combinations that yield self-assembly of a…

Soft Condensed Matter · Physics 2020-03-13 Beth A Lindquist

In this paper, we establish the conditions for some finite abelian groups and the family all the $k$-sets in each of them summing up to an element $x$ to form $t$-designs. We fully characterize the sufficient and necessary conditions for…

Combinatorics · Mathematics 2025-06-03 Hengfeng Liu , Chunming Tang , Cuiling Fan , Rong Luo

We describe deformations of the noncompact Calabi-Yau threefolds $W_k = \mbox{Tot}(\mathcal{O}_{\mathbb{P}^1}(-k) \oplus \mathcal{O}_{\mathbb{P}^1}(k-2))$ for $k=1,2,3$, as well as their moduli of holomorphic vector bundles of rank $2$.…

Algebraic Geometry · Mathematics 2019-09-05 Elizabeth Gasparim , Thomas Köppe , Francisco Rubilar , Bruno Suzuki

An ordered biclique partition of the complete graph $K_n$ on $n$ vertices is a collection of bicliques (i.e., complete bipartite graphs) such that (i) every edge of $K_n$ is covered by at least one and at most two bicliques in the…

Computational Complexity · Computer Science 2013-12-30 Manami Shigeta , Kazuyuki Amano

Given a sparse undirected graph G with weights on the edges, a k-plex partition of G is a partition of its set of nodes such that each component is a k-plex. A subset of nodes S is a k-plex if the degree of every node in the associated…

Combinatorics · Mathematics 2016-12-20 Pedro Martins