On the codimension of the variety of symmetric matrices with multiple eigenvalues

According to a result of Wigner and von Neumann, the dimension of the set of n × n real symmetric matrices with multiple eigenvalues is equal to N −2, where N = n(n+1)/2. This value is determined by counting the number of free parameters in the spectral decomposition of a matrix. We show that the same dimension is obtained if is interpreted as an algebraic variety. Bibliography: 4 titles. __________ Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 323, 2005, pp. 34–46.     

State operators on generalizations of fuzzy structures

We enlarge the language of R?-monoids, which are a non-commutative generalizations of both MV algebras and BL algebras, by adding a unary operation that describes algebraic properties of a state (= an analog of probability measures). The resulting algebras are called stateR?-monoids and state-morphismR?-monoids. We present basic properties of such algebras. We describe subdirectly irreducible algebras, some generators of the varieties of state-morphism R?-monoids, and an interplay between states and state operators.     

Copper(II) ion hydrolysis in aqueous solution

A copper(II) ion-selective-electrode potentiometric method was used to determine the first and second hydrolysis constants of Cu²⁺. Special techniques prevented copper(II) hydroxide precipitation, and copper(II) carbonate and cipper(II) organic complexation during the titration of the experimental solution over the pH range 6.8–8.4. The large change in the total copper concentration during the titration due to adsorption of copper onto the vessel walls was accounted for by measuring the total copper concentration at each pH by atomic absorption spectrophotometry. The two hydrolysis constants were determined at 25°C in 0.7 and 0.05m NaClO₄ media. The measured stability constants are independent of the copper concentration and yield similar zero ionic strength values. Also, the stepwise equilibrium constants decrease as the ligand number increases.     

Lifting Galois representations of number fields

Let F be a number field. Given a continuous representation with insoluble image we show, under moderate assumptions at primes dividing ?∞, that for some continuous representation which is unramified outside finitely many primes. We also establish level lowering when F is totally real, is the reduction of a nearly ordinary Hilbert modular form and is distinguished at ?.     

Geometric configurations of singularities for quadratic differential systems with three distinct real simple finite singularities

In this work we classify, with respect to the geometric equivalence relation, the global configurations of singularities, finite and infinite, of quadratic differential systems possessing exactly three distinct finite simple singularities. This relation is finer than the topological equivalence relation which does not distinguish between a focus and a node or between a strong and a weak focus or between foci (or saddles) of different orders. Such distinctions are, however, important in the production of limit cycles close to the foci (or loops) in perturbations of the systems. The notion of geometric equivalence relation of configurations of singularities allows us to incorporate all these important geometric features which can be expressed in purely algebraic terms. The geometric classification of all configurations of singularities, finite and infinite, of quadratic systems was initiated in a work published in 2013 when the classification was done for systems with total multiplicity m _f of finite singularities less than or equal to one. That work was continued in an article which is due to appear in 2014 where the geometric classification of configurations of singularities was done for the case m _f = 2. In this article we go one step further and obtain the geometric classification of singularities, finite and infinite, for the subclass mentioned above. We obtain 147 geometrically distinct configurations of singularities for this family. We give here the global bifurcation diagram of configurations of singularities, both finite and infinite, with respect to the geometric equivalence relation, for this class of systems. The bifurcation set of this diagram is algebraic. The bifurcation diagram is done in the 12-dimensional space of parameters and it is expressed in terms of polynomial invariants, a fact which gives us an algorithm for determining the geometric configuration of singularities for any quadratic system in this particular class.     

On the computation of scaling coefficients of Daubechies' wavelets

In the present paper, Daubechies' wavelets and the computation of their scaling coefficients are briefly reviewed. Then a new method of computation is proposed. This method is based on the work [7] concerning a new orthonormality condition and relations among scaling moments, respectively. For filter lengths up to 16, the arising system can be explicitly solved with algebraic methods like Gröbner bases. Its simple structure allows one to find quickly all possible solutions.     

On general algebraic mechanisms for producing centers in polynomial differential systems

We classify nondegenerate centers of systems of the form

Constructing near spanning trees with few local inspections

Constructing a spanning tree of a graph is one of the most basic tasks in graph theory. Motivated by several recent studies of local graph algorithms, we consider the following variant of this problem. Let G be a connected bounded‐degree graph. Given an edge e in G we would like to decide whether e belongs to a connected subgraph consisting of edges (for a prespecified constant ), where the decision for different edges should be consistent with the same subgraph . Can this task be performed by inspecting only a constant number of edges in G ? Our main results are:

• We show that if every t‐vertex subgraph of G has expansion then one can (deterministically) construct a sparse spanning subgraph of G using few inspections. To this end we analyze a “local” version of a famous minimum‐weight spanning tree algorithm.
• We show that the above expansion requirement is sharp even when allowing randomization. To this end we construct a family of 3‐regular graphs of high girth, in which every t‐vertex subgraph has expansion . We prove that for this family of graphs, any local algorithm for the sparse spanning graph problem requires inspecting a number of edges which is proportional to the girth.

© 2016 Wiley Periodicals, Inc. Random Struct. Alg., 50, 183–200, 2017     

An equivariant Brauer semigroup and the symmetric imprimitivity theorem

Suppose that is a second countable locally compact transformation group. We let denote the set of Morita equivalence classes of separable dynamical systems where is a -algebra and is compatible with the given -action on . We prove that is a commutative semigroup with identity with respect to the binary operation for an appropriately defined balanced tensor product on -algebras. If and act freely and properly on the left and right of a space , then we prove that and are isomorphic as semigroups. If the isomorphism maps the class of to the class of , then is Morita equivalent to .