Related papers: Generalized Spectral Bound for Quasi-Twisted Codes
Minimization variational principles for linear elastodynamic, acoustic, or electromagnetic time-harmonic waves in dissipative media were obtained by Milton, Seppecher and Bouchitt\'e generalizing the quasistatic variational principles of…
We give the first constant-factor approximation for the Directed Latency problem in quasi-polynomial time. Here, the goal is to visit all nodes in an asymmetric metric with a single vehicle starting at a depot $r$ to minimize the average…
The class of quasisymmetric mappings on the real axis was first introduced by A. Beurling and L. V. Ahlfors in 1956. In 1980 P. Tukia and J. V\"{a}is\"{a}l\"{a} considered these mappings between general metric spaces. In our paper we…
H. A. Hayden [1] introduced the idea of semi-symmetric non-metric connection on a Riemannian manifold in (1932). Agashe and Chafle \cite{1} defined and studied semi-symmetric non-metric connection on a Riemannian manifold. In the present…
Based on cyclic and consta-cyclic simplex codes, a new explicit construction of a family of two-weight codes is presented. These two-weight codes obtained are in the form of 2-generator quasi-cyclic, or quasi-twisted structure. Based on…
The tensor product of one code endowed with the Hamming metric and one endowed with the rank metric is analyzed. This gives a code which naturally inherits the sum-rank metric. Specializing to the product of a cyclic code and a skew-cyclic…
Computing the reversal distances of signed permutations is an important topic in Bioinformatics. Recently, a new lower bound for the reversal distance was obtained via the plane permutation framework. This lower bound appears different from…
Linear and projective boundaries of Cayley graphs were introduced in~\cite{kst} as quasi-isometry invariant boundaries of finitely generated groups. They consist of forward orbits $g^\infty=\{g^i: i\in \mathbb N\}$, or orbits…
Bound states in the continuum (BICs) are widely known spatially localized states experimentally implemented as quasi-BICs. Although they emerged as a promising solution for achieving high-quality resonances in photonic structures,…
We investigate the regularity condition for twisted spectral triples. This condition is equivalent to the existence of an appropriate pseudodifferential calculus compatible with the spectral triple. A natural approach to obtain such a…
Grand symmetry models in noncommutative geometry have been introduced to explain how to generate minimally (i.e. without adding new fermions) an extra scalar field beyond the standard model, which both stabilizes the electroweak vacuum and…
In this paper, we study graph distances in the geometric random graph models scale-free percolation SFP, geometric inhomogeneous random graphs GIRG, and hyperbolic random graphs HRG. Despite the wide success of the models, the parameter…
The results of J. F. Qiann et al. [4] on $(1-\gamma)$-cyclic codes over finite chain rings of nilpotency index 2 are extended to $(1-\gamma^e)$-cyclic codes over finite chain rings of arbitrary nilpotency index $e+1$. The Gray map is…
In 2005, Li, Tao, Thiele and the author raised a general question concerning upper bounds for a class of multilinear oscillatory integral operators, and established such bounds in a few cases. Most cases remain open. The present paper is…
We show that every sufficiently large oriented graph $G$ with minimum indegree and outdegree both at least $(3|V(G)|-1)/8$ contains every orientation of a Hamilton cycle. This result improves the approximate bound established by Kelly and…
We derive a new estimate of the size of finite sets of points in metric spaces with few distances. The following applications are considered: (1) we improve the Ray-Chaudhuri--Wilson bound of the size of uniform intersecting families of…
Recent results by Chen et al. and Polyanskiy et al. explore using feedback to approach capacity with short blocklengths. This paper explores Chernoff bounding techniques to extend the rate-compatible sphere-packing (RCSP) analysis proposed…
This paper presents new lower bounds for the first general Zagreb index $Z_{\alpha}(G)$ involving two, three, and four arbitrary degrees of vertices of a simple graph $G$. For the special cases $\alpha = 2$ and $\alpha = -2$, the results…
It was shown by Massey that linear complementary dual (LCD for short) codes are asymptotically good. In 2004, Sendrier proved that LCD codes meet the asymptotic Gilbert-Varshamov (GV for short) bound. Until now, the GV bound still remains…
We give a simple proof of a well-known theorem of G\'al and of the recent related results of Aistleitner, Berkes and Seip [1] regarding the size of GCD sums. In fact, our method obtains the asymptotically sharp constant in G\'al's theorem,…