DNS is one of the most important components of the Internet infrastructure. Unfortunately, it is known to be difficult to implement, and available implementations are difficult to configure correctly. DNS performance and availability often suffer from poor configuration which leads to unavailability or erroneous behavior of distributed systems that depend on DNS. The data structures of DNS are ...

The classical supervised pattern recognition problem is considered. A model of learning Boolean formulas is implemented. A new computational procedure for constructing quantitative non-reducible descriptors is suggested. The proposed procedure has a diminished number of computational operations with respect to the procedure for constructing non-reducible descriptors and allows incremental learn...

An integral domain $D$ is called a emph{locally GCD domain} if $D_{M}$ is aGCD domain for every maximal ideal $M$ of $D$. We study somering-theoretic properties of locally GCD domains. E.g., we show that $%D$ is a locally GCD domain if and only if $aDcap bD$ is locally principalfor all $0neq a,bin D$, and flat overrings of a locally GCD domain arelocally GCD. We also show that the t-class group...

Proof: (R ⊂ κ(G, s)). Let I ⊂ M(G, s) be a nonempty ideal. Fix ψ ∈ I. Given σ ∈ R, there exists a sandpile φ such that σ = (φ + ψ)◦ by defintion. Since I is an ideal, this implies that σ ∈ I. Hence R ⊂ I. We conclude that R ⊂ ⋂ I ideal of M(G,s) I = κ(G, s). (κ(G, s) ⊂ R). Recall that R 6= ∅. Since κ(G, s) is the minimal ideal of M(G, s), it is enough to show that R is an ideal. Consider σ ∈ R ...

Let X be a smooth projective curve of genus g =2. For ah integers r,& with r > O let M(X;r,6) be the modulí seheme of rank r stable vector bundíes on X with degree 6. Here we prove that for ahí integers vi, d with vi > 3 and d > (5n — 8)g + 2n2 — 5» + 4 there is a» open dense suhset S2 of M<X; vi —1, (vi + 1)d+2g— 2) such that for every N Ef? there isa non-degenerate degree d embedding of X in ...

In this work, we initiate the formal treatment of cryptographic constructions (“Polly Cracker”) based on the hardness of computing remainders modulo an ideal. We start by formalising and studying the relation between the ideal remainder problem and the problem of computing a Gröbner basis. We show both positive and negative results. On the negative side, we define a symmetric Polly Cracker encr...

Suppose M is a maximal ideal of a commutative integral domain R and that some power Mn of M is finitely generated. We show that M is finitely generated in each of the following cases: (i) M is of height one, (ii) R is integrally closed and htM = 2, (iii) R = K[X; S̃] is a monoid domain over a field K, where S̃ = S ∪ {0} is a cancellative torsion-free monoid such that ⋂∞ m=1 mS = ∅, and M is the m...

The Hilbert scheme H n of n points in A d contains an irreducible component Rdn which generically represents n distinct points in A. We show that when n is at most 8, the Hilbert scheme H n is reducible if and only if n = 8 and d ≥ 4. In the simplest case of reducibility, the component R 8 ⊂ H 8 is defined by a single explicit equation which serves as a criterion for deciding whether a given id...

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gauß count the remaining ones, approximately and exactly. For polynomials in two or more variables, the situation changes dramatically. Most multivariate polynomials are irreducible. This survey presents counting results for some special classes of mu...