Related papers: Bounds for Combinatorial Types of Non-Attacking Ri…
The additive codes may have better parameters than linear codes. However, it is still a challenging problem to efficiently construct additive codes that outperform linear codes, especially those with greater distances than linear codes of…
In the Collatz 3x+1 problem, there are 3 possibilities: Starting from any positive number, we either reach the trivial loop (1,4,2), end up in a non-trivial loop, or go until infinity. In this paper, we shall show that if a non-trivial loop…
We propose a combinatorial method of proving non-specialty of a linear system of curves with multiple points in general positions. As an application we obtain a classification of special linear systems on P1xP1 for which the multiplicities…
We demonstrate propagation rules of subsystem code constructions by extending, shortening and combining given subsystem codes. Given an $[[n,k,r,d]]_q$ subsystem code, we drive new subsystem codes with parameters $[[n+1,k,r,\geq d]]_q$,…
Traffic state estimation plays an important role in facilitating effective traffic management. This study develops a combinatorial approach for nonparametric short-term queue length estimation in terms of cycle-by-cycle partially observed…
A body moves in a medium composed of noninteracting point particles; interaction of particles with the body is absolutely elastic. It is required to find the body's shape minimizing or maximizing resistance of the medium to its motion. This…
The aim of this paper is to give not only an explicit upper bound of the total Q-curvature but also an induced isoperimetric deficit formula for the complete conformal metrics on $\mathbb R^n$, $n\ge 3$ with scalar curvature being…
We study a family of type II multiple orthogonal polynomials. We consider orthogonality conditions with respect to a vector measure, in which each component is a q-analogue of the binomial distribution. The lowering and raising operators as…
This letter treats the quantum random walk on the line determined by a 2 times 2 unitary matrix U. A combinatorial expression for the mth moment of the quantum random walk is presented by using 4 matrices, P, Q, R and S given by U. The…
We prove that cooperativity in Boolean networks precludes a strong notion of sensitive dependence on initial conditions. Weaker notions of sensitive dependence are shown to be consistent with cooperativity, but if each regulatory functions…
We present a lower bound for the multi-field bounce action with a quartic potential in the absence of gravity. We find that for a large number of fields the lower bound decreases with the number of fields as N^{-3}. This work clarifies…
We obtain an upper bound for the number of attractors and repellers that can appear from small perturbations of a sectional hyperbolic set. This extends results from [Sectional-Anosov flows in higher dimensions] and [The explosion of…
Upper bounds are obtained for the $p$-capacity of compact sets in $\R^d$, with $d \ge 2$ and $1<p<d$. Upper and lower bounds are obtained for the product of $p$-capacity and powers of the $q$-torsional rigidity over the collection of all…
Some type-based approaches to termination use sized types: an ordinal bound for the size of a data structure is stored in its type. A recursive function over a sized type is accepted if it is visible in the type system that recursive calls…
A numerical solution is presented for the non-linear evolution equation that governs the dynamics of high parton density QCD. It is shown that thesolution falls off as $e^{-b/R}$ at large values of the impact parameter $b$. The power-like…
We discuss the existing limits on top flavour-changing neutral couplings in models with new vector-like quarks. Large hadron and e+ e- colliders can improve these bounds by more than one order of magnitude.
In this article, the partial plane spreads in $PG(6,2)$ of maximum possible size $17$ and of size $16$ are classified. Based on this result, we obtain the classification of the following closely related combinatorial objects: Vector space…
Let $\mathcal{X}$ be a set of $(h-1)$-dimensional subspaces of $\mathrm{PG}(kh-1,q)$ with the property that every hyperplane contains at most $t$ elements of $\mathcal{X}$. We prove the upper bound $|\mathcal{X}| \leq (t-k+2)q^h + t$, and…
The number A(q) is the upper limit of the ratio of the maximum number of points of a curve defined over $\Fq$ to the genus. By constructing class field towers with good parameters we present improvements of lower bounds of A(q) for q an odd…
By exploiting the connection between scattered $\mathbb{F}_q$-subspaces of $\mathbb{F}_{q^m}^3$ and minimal non degenerate $3$-dimensional rank metric codes of $\mathbb{F}_{q^m}^{n}$, $n \geq m+2$, described in [2], we will exhibit a new…