相关论文: A Locale for Minimal Bad Sequences
Constructions of optimal locally repairable codes (LRCs) in the case of $(r+1) \nmid n$ and over small finite fields were stated as open problems for LRCs in [I. Tamo \emph{et al.}, "Optimal locally repairable codes and connections to…
In this article, We introduce a condition that is both necessary and sufficient for a linear code to achieve minimality when analyzed over the rings $\mathbb{Z}_{n}$.The fundamental inquiry in minimal linear codes is the existence of a…
We prove that 2-Local Hamiltonian (2-LH) with Low Complexity problem is QCMA-complete by combining the results from the QMA-completeness[4] of 2-LH and QCMA-completeness of 3-LH with Low Complexity[6]. The idea is straightforward. It has…
This paper investigates why it is beneficial, when solving a problem, to search in the neighbourhood of a current solution. The paper identifies properties of problems and neighbourhoods that support two novel proofs that neighbourhood…
This paper investigates what properties a neighbourhood requires to support beneficial local search. We show that neighbourhood locality, and a reduction in cost probability towards the optimum, support a proof that search among neighbours…
Two simple "simplicial approximation" tricks are invoked to prove basic results involving (co)-homology with local coefficients.
By proving a local limit theorem for higher-order transitions, we determine the time required for necklace chains to be close to stationarity. Because necklace chains, built by arranging identical smaller chains around a directed cycle, are…
In this paper, locally repairable codes with all-symbol locality are studied. Methods to modify already existing codes are presented. Also, it is shown that with high probability, a random matrix with a few extra columns guaranteeing the…
We aim to mine temporal causal sequences that explain observed events (consequents) in time-series traces. Causal explanations of key events in a time-series has applications in design debugging, anomaly detection, planning, root-cause…
The Lov\'asz Local Lemma (the LLL for short) is a powerful tool in probabilistic combinatorics that is used to verify the existence of combinatorial objects with desirable properties. Recent years saw the development of various…
Let $\mathcal{H}$ be a separable Hilbert space and $\mathcal{L}_{0}\subset B(\mathcal{H})$ a complete reflexive lattice. Let $\mathscr{K}$ be the direct sum of $n_0$ copies of $\mathcal{H}$ ($n_{0}\in\mathbb{N}$ and $n_0\geq 2$) or the…
For a text given in advance, the substring minimal suffix queries ask to determine the lexicographically minimal non-empty suffix of a substring specified by the location of its occurrence in the text. We develop a data structure answering…
We give a constructive proof that $R[X]$ is normal when $R$ is normal. We apply this result to an operation needed for studying the henselization of a local ring. Our proof is based on the case where $R$ is without zero divisors, which is…
This paper deals with algorithms for producing and ordering lexical and nonlexical sequences of a given degree. The notion of "elementary operations" on positive integral sequences is introduced. Our main theorem answers the question of…
Motivated by the structural analogies between point lattices and linear error-correcting codes, and by the mature theory on locally testable codes, we initiate a systematic study of local testing for membership in lattices. Testing…
If a complex $X$ is a subcomplex of a diagrammatically reducible 2-complex $Y$ that has locally indicable fundamental group, then $X$ has locally indicable fundamental group. This is a consequence of the Corson-Trace characterization of…
J. Y. Hyun, et al. (Des. Codes Cryptogr., vol. 88, pp. 2475-2492, 2020) constructed some optimal and minimal binary linear codes generated by one or two order ideals in hierarchical posets of two levels. At the end of their paper, they left…
We obtain scales of minimal complexity in $K(\mathbb{R})$ using a Levy hierarchy and a fine structure theory for $K(\mathbb{R})$; that is, we identify precisely those levels of the Levy hierarchy for $K(\mathbb{R})$ which possess the scale…
This article is Part I in a series of three papers devoted to determining the minimal complexity of scales in the inner model $K(\mathbb{R})$. Here, in Part I, we shall complete our development of a fine structure theory for $K(\mathbb{R})$…
We study generalized fractional $p$-Laplacian equations to prove local boundedness and H\"older continuity of weak solutions to such nonlocal problems by finding a suitable fractional Sobolev-Poincar\'e inquality.