We consider quasi-perfect codes in Z over the `p metric, 2 ≤ p <∞. Through a computational approach, we determine all radii for which there are linear quasi-perfect codes for p = 2 and n = 2, 3. Moreover, we study codes with a certain degree of imperfection, a notion that generalizes the quasi-perfect codes. Numerical results concerning the codes with the smallest degree of imperfection are pre...

We consider the class of constant depth AND/OR circuits augmented with a layer of modular counting gates at the bottom layer, i.e AC◦MODm circuits. We show that the following holds for several types of gates G: by adding a gate of type G at the output, it is possible to obtain an equivalent probabilistic depth 2 circuit of quasipolynomial size consisting of a gate of type G at the output and a ...

We explicitly determine quasi-polynomials describing the weight multiplicities of the Lie algebra so5(C). This information entails immediate complete knowledge of the character of any simple representation as well as the asymptotic behavior of characters.

Smallest and greatest 1-Lipschitz aggregation operators with given diagonal section, opposite diagonal section, and with graphs passing through a single point of the unit cube, respectively, are determined. These results are used to find smallest and greatest copulas and quasi-copulas with these properties (provided they exist).

A d-space X = (X, %, μ) is a compact set X with respect to a quasi-metric % and a Borel measure μ such that the measure of a ball of radius r is equivalent to r, where d > 0. The paper deals with spaces B p(X;H) of Besov type where 1 < p < ∞ and s ∈ R. Here H is a bi-Lipschitzian map of the snowflaked version (X, %, μ) of X for some 0 < ε < 1, onto a fractal d/ε-set Γ = HX in some R, reducing t...

That acknowledged, I am of the opinion that mathematical philosophy matters more now than it has in nearly a century. The power of modern computers matched with that of modern mathematical software and the sophistication of current mathematics is changing the way we do mathematics. In my view it is now both necessary and possible to admit quasi-empirical inductive methods fully into mathematica...

Let 2 be a binary relation on R’!+. The convexed relation 2 is defined by xky iff Vz[y~conv{w:w~z}]*[x~conv{w:w~z)] [see Hildenbrand (1974)]. Starr (1969), first formally presented this relation, which was used by him and by others in equilibrium analysis of markets with non-convex preference relations [see for example Shaked (1976)]. The question arises which properties of the unconvexed relat...

k-anonymity is the method used for masking sensitive data which successfully solves the problem of re-linking of data with an externa l source and makes it difficul t to l'e-iden tify the individual. T hus kanonymity works on a set of quasi-identifiers (public sensitive at t ributes), whose possible availability and linking is anticipated from external dataset , and demands that the released da...

Alrstract--We consider the robust stability problem for a class of uncertain neutral time-delay systems where the characteristic equations involve a polytope ~ of quasipolynomials of neutral type. Given a stability region D in the complex plane our goal is to find a constructive technique to verify the D-stability of ~ (i.e. to verify whether the roots of every quasipolynomial in ~ all belong t...

The ring decomposition technique of part I is extended to the case when the factors in the direct product decomposition are no longer fields but arbitrary chain rings. This includes not only the case of quasi-cyclic codes over rings but also the case of quasi-cyclic codes over fields whose co-index is no longer prime to the characteristic of the field. A new quaternary construction of the Leech...