Related papers: A criterion for determining whether multiple shell…
Shell structure in the single particle spectrum of deformed harmonic oscillator potentials when a term proportional to $(\vec L)^2$ is added is analyzed for a large particle number. A scaling law which gives a dividing line between regular…
Linear regression models depend directly on the design matrix and its properties. Techniques that efficiently estimate model coefficients by partitioning rows of the design matrix are increasingly popular for large-scale problems because…
Biological materials exhibit complex structure-property relationships which are only beginning to be elucidated. Understanding the underlying physical mechanisms of the structure-property relationships is the key to designing bioinspired…
An automorphism group of an incidence structure I induces a tactical decomposition on I. It is well known that tactical decompositions of t-designs satisfy certain necessary conditions which can be expressed as equations in terms of the…
We propose an algorithmic test to check whether a two-input system is linearizable by an endogenous dynamic feedback with a dimension of at most two. This test furthermore provides a procedure for systematically deriving flat outputs for…
The hull of a linear code $C$ is the intersection of $C$ with its dual code. We present and analyze the number of linear $q$-ary codes of the same length and dimension but with different dimensions for their hulls. We prove that for given…
Protein folds are highly designable, in the sense that many sequences fold to the same conformation. In the present work we derive an expression for the designability in a 20 letter lattice model of proteins which, relying only on the…
The combinatorial properties of partitions with various restrictions on their hooksets are explored. A connection with numerical semigroups extends current results on simultaneous s/t-cores. Conditions that suffice for a partition to…
In this paper we give an explicit construction of a capacity achieving family of binary t-write WOM codes for any number of writes t, that have a polynomial time encoding and decoding algorithms. The block length of our construction is…
For paired comparison experiments involving competing options described by two-level attributes several different methods of constructing designs having block paired observations under the main effects model are presented. These designs are…
We study the problem of deciding whether a crease pattern can be folded by simple folds (folding along one line at a time) under the infinite all-layers model introduced by [Akitaya et al., 2017], in which each simple fold is defined by an…
We present an entanglement criterion for multiqubits by using the quantum correlation tensors which rely on the expectation values of the Pauli operators for a multiqubit state. Our criterion explains not only the total entanglement of the…
Reflection is an often addressed design goal in Human-Computer Interaction (HCI) research. An increasing number of artefacts for reflection have been developed in recent years. However, evaluating if and how an interactive technology helps…
A linear code is said to be $\Delta$-divisible if the Hamming weights of all its codewords are divisible by $\Delta$. The $p$-adic valuation of a code is defined as the greatest integer $t$ such that the code is $p^t$-divisible. In this…
Glyph-based visualization is one of the main techniques for visualizing complex multivariate data. With small glyphs, data variables are typically encoded with relatively low visual and perceptual precision. Glyph designers have to…
We propose a successive generation of cutting inequalities for binary quadratic optimization problems. Multiple cutting inequalities are successively generated for the convex hull of the set of the optimal solutions $\subset \{0, 1\}^n$,…
Designs for Order-of-Addition (OofA) experiments have received growing attention due to their impact on responses based on the sequence of component addition. In certain cases, these experiments involve heterogeneous groups of units, which…
I give an elementary proof that a quasi-symmetric design without repeated blocks on $v$ points has at most $v\choose2$ blocks, with equality if and only if it is a tight $4$-design.
Several authors devised type-based termination criteria for ML-like languages allowing non-structural recursive calls. We extend these works to general rewriting and dependent types, hence providing a powerful termination criterion for the…
We propose easily verifiable necessary and sufficient conditions for the linearizability of two-input systems by an endogenous dynamic feedback with a dimension of at most two.