English
Related papers

Related papers: Construction of three classes of Strictly Optimal …

200 papers

In this paper we provide a complete characterisation of transitive fractional jumps by showing that they can only arise from transitive projective automorphisms. Furthermore, we prove that such construction is feasible for arbitrarily large…

Number Theory · Mathematics 2019-02-13 Federico Amadio Guidi , Giacomo Micheli

In this paper infinite families of linear binary nested completely regular codes are constructed. They have covering radius $\rho$ equal to $3$ or $4$, and are $1/2^i$-th parts, for $i\in\{1,\ldots,u\}$ of binary (respectively, extended…

Combinatorics · Mathematics 2014-04-28 J. Borges , J. Rifà , V. A. Zinoviev

The hierarchy of pure states (HOPS) is a wavefunction-based method which can be used for numerically modeling open quantum systems. Formally, HOPS recovers the exact system dynamics for an infinite depth of the hierarchy. However,…

Chemical Physics · Physics 2018-04-18 P. -P. Zhang , C. D. B. Bentley , A. Eisfeld

We consider several classes of complete intersection numerical semigroups, aris- ing from many different contexts like algebraic geometry, commutative algebra, coding theory and factorization theory. In particular, we determine all the…

Commutative Algebra · Mathematics 2014-04-08 Marco D'Anna , Vincenzo Micale , Alessio Sammartano

High-dimensional clustering analysis is a challenging problem in statistics and machine learning, with broad applications such as the analysis of microarray data and RNA-seq data. In this paper, we propose a new clustering procedure called…

Methodology · Statistics 2022-10-31 Tianqi Liu , Yu Lu , Biqing Zhu , Hongyu Zhao

Set Shaping Theory (SST) moves beyond the classical fixed-space model by constructing bijective mappings the original sequence set into structured regions of a larger sequence space. These shaped subsets are characterized by a reduced…

Information Theory · Computer Science 2026-01-23 A. Schmidt , A. Vdberg , A. Petit

Unsupervised Semantic Segmentation (USS) involves segmenting images without relying on predefined labels, aiming to alleviate the burden of extensive human labeling. Existing methods utilize features generated by self-supervised models and…

Computer Vision and Pattern Recognition · Computer Science 2024-04-08 Baran Ozaydin , Tong Zhang , Deblina Bhattacharjee , Sabine Süsstrunk , Mathieu Salzmann

We introduce a forcing technique to construct three-dimensional arrays of generic extensions through FS (finite support) iterations of ccc posets, which we refer to as 3D-coherent systems. We use them to produce models of new constellations…

Logic · Mathematics 2017-03-30 Vera Fischer , Sy D. Friedman , Diego A. Mejía , Diana C. Montoya

The sizes of optimal constant-composition codes of weight three have been determined by Chee, Ge and Ling with four cases in doubt. Group divisible codes played an important role in their constructions. In this paper, we study the problem…

Information Theory · Computer Science 2014-10-03 Wei Hengjia , Zhang Hui , Zhu Mingzhi , Ge Gennian

Since the first theoretically feasible full homomorphic encryption (FHE) scheme was proposed in 2009, great progress has been achieved. These improvements have made FHE schemes come off the paper and become quite useful in solving some…

Cryptography and Security · Computer Science 2024-03-19 Yuqi Guo , Lin Li , Zhongxiang Zheng , Hanrui Yun , Ruoyan Zhang , Xiaolin Chang , Zhixuan Gao

We develop a topological classification of non-Hermitian effective Hamiltonians that depend on momentum and frequency. Such effective Hamiltonians are in one-to-one correspondence to single-particle Green's functions of systems that satisfy…

Strongly Correlated Electrons · Physics 2023-04-14 Maximilian Kotz , Carsten Timm

A family of binary sequences is presented and proved to have optimal correlation property and large linear span. It includes the small set of Kasami sequences, No sequence set and TN sequence set as special cases. An explicit lower bound…

Cryptography and Security · Computer Science 2016-09-07 Xiangyong Zeng , Lei Hu , Qingchong Liu

The binary Hamming codes with parameters $[2^m-1, 2^m-1-m, 3]$ are perfect. Their extended codes have parameters $[2^m, 2^m-1-m, 4]$ and are distance-optimal. The first objective of this paper is to construct a class of binary linear codes…

Information Theory · Computer Science 2020-01-07 Ziling Heng , Cunsheng Ding , Weiqiong Wang

Spread spectrum multiple access systems demand minimum possible cross-correlation between the sequences within a set of sequences having good auto-correlation properties. Through a connection between generalised Frank sequences and…

Information Theory · Computer Science 2023-08-10 Dan Zhang , Staal A. Vinterbo

The motivation of this work is to improve the performance of standard stacking approaches or ensembles, which are composed of simple, heterogeneous base models, through the integration of the generation and selection stages for regression…

Machine Learning · Statistics 2014-03-31 Roberto Aldave , Jean-Pierre Dussault

Scattered sequences are a generalization of scattered polynomials. So far, only scattered sequences of order one and two have been constructed. In this paper an infinite family of scattered sequences of order three is obtained. Equivalence…

Combinatorics · Mathematics 2023-08-11 Daniele Bartoli , Alessandro Giannoni

It is shown how to systematically construct the $XX$ quantum spin chains with nearest-neighbor interactions that allow perfect state transfer (PST). Sets of orthogonal polynomials (OPs) are in correspondence with such systems. The key…

Quantum Physics · Physics 2013-05-30 Luc Vinet , Alexei Zhedanov

In recent years, multi-view multi-label learning (MVML) has attracted extensive attention due to its close alignment to real-world scenarios. Information-theoretic methods have gained prominence for learning nonlinear correlations. However,…

Machine Learning · Computer Science 2026-03-04 Cheng Peng , Yonghao Li , Wanfu Gao , Jie Wen , Weiping Ding

This letter presents a direct construction of cross Z-complementary sequence sets (CZCSSs), whose aperiodic correlation sums exhibit zero correlation zones at both the front-end and tail-end shifts. CZCSS can be regarded as an extension of…

Information Theory · Computer Science 2022-07-07 Praveen Kumar , Sudhan Majhi , Subhabrata Paul

We present a procedure to enumerate the whole set of numerical semigroups with a given Frobenius number F, S(F). The methodology is based on the construction of a partition of S(F) by a congruence relation. We identify exactly one…

Commutative Algebra · Mathematics 2011-05-26 V. Blanco , J. C. Rosales
‹ Prev 1 4 5 6 7 8 10 Next ›