Related papers: Set Size Bound for Aperiodic Z-Complementary Sets
We give a new asymptotic upper bound on the size of a code in the Grassmannian space. The bound is better than the upper bounds known previously in the entire range of distances except very large values.
We consider extension of a closure system on a finite set S as a closure system on the same set S containing the given one as a sublattice. A closure system can be represented in different ways, e.g. by an implicational base or by the set…
It is known that if the underlying iterated function system satisfies the open set condition, then the upper box dimension of an inhomogeneous self-similar set is the maximum of the upper box dimensions of the homogeneous counterpart and…
In this paper, we study minimal (with respect to inclusion) zero forcing sets. We first investigate when a graph can have polynomially or exponentially many distinct minimal zero forcing sets. We also study the maximum size of a minimal…
Various authors have calculated how many pairwise incomparable points can be selected from a partially ordered set. We tackle this question for the family of subsets of a finite set obtained by removing or adding a bounded number of…
In recent years, complementary sequence sets have found many important applications in multi-carrier code-division multiple-access (MC-CDMA) systems for their good correlation properties. In this paper, we propose a construction, which can…
Let G be a graph with a perfect matching. A complete forcing set of G is a subset of edges of G to which the restriction of every perfect matching is a forcing set of it. The complete forcing number of G is the minimum cardinality of…
It is well known that a pair of compact sets in $\mathbb{R}^d$ ($d \in \mathbb{N}$) can be separated by small deformations if the sum of their upper box dimensions is less than $d$. In this paper, we demonstrate that this dimension…
ZFC has sentences that quantify over all sets or all ordinals, without restriction. Some have argued that sentences of this kind lack a determinate meaning. We propose a set theory called TOPS, using Natural Deduction, that avoids this…
This thesis is a study of large sets of unit vectors in $\cx^n$ such that the absolute value of their standard inner products takes on only a small number of values. We begin with bounds: what is the maximal size of a set of lines with only…
We address a problem posed by Nathan Kaplan in the 2014 Combinatorial and Additive Number Theory session: finding the largest subset $H \subseteq (\mathbb{Z}/4\mathbb{Z})^n$ with no distinct $x, y, z \in H$ such that $x + y + z \equiv 0…
Sponges were recently proposed as a generalization of lattices, focussing on joins/meets of sets, while letting go of associativity/transitivity. In this work we provide tools for characterizing and constructing sponges on metric spaces and…
We present a unifying, consistent, finite-size-scaling picture for percolation theory bringing it into the framework of a general, renormalization-group-based, scaling scheme for systems above their upper critical dimensions $d_c$.…
Above the upper critical dimension, the breakdown of hyperscaling is associated with dangerous irrelevant variables in the renormalization group formalism at least for systems with periodic boundary conditions. While these have been…
We present new upper bounds on the parameters of batch codes with restricted query size. These bounds are an improvement on the Singleton bound. The techniques for derivations of these bounds are based on the ideas in the literature for…
Additive codes may have better parameters than linear codes. However, still very few cases are known and the explicit construction of such codes is a challenging problem. Here we show that a Griesmer type bound for the length of additive…
Let $(G,+)$ be an Abelian group. Given $h\in \mathbb{Z}^+$, a non-empty subset $A$ of $G$ is called an $S_h$-set if all the sums of $h$ distinct elements of $A$ are different. We extend the concept of $S_h$-set to a more general context in…
One method to determine whether or not a system of partial differential equations is consistent is to attempt to construct a solution using merely the "algebraic data" associated to the system. In technical terms, this translates to the…
We obtain a exponential large deviation upper bound for continuous observables on suspension semiflows over a non-uniformly expanding base transformation with non-flat singularities and/or discontinuities, where the roof function defining…
Conformal prediction is a generic methodology for finite-sample valid distribution-free prediction. This technique has garnered a lot of attention in the literature partly because it can be applied with any machine learning algorithm that…