Search results for "Abstract algebra"
showing 10 items of 452 documents
Structure of Liquids
2014
An Introduction to the description of the static structure of simple liquids is given. The principle quantity, which describes this structure is the structure factor, which can be measured with neutron and X-ray diffraction. The structure factor is the Fourier transform of the radial pair distribution function, which describes the statistics of the atoms around a given one. Several theories are introduced for calculating this quantities. It is shown that the structure of liquid metals is dominated by their hardcore repulsion. In the low-wavenumber limit the structure factor is related to the compressibility of the liquid. In this limit deviations from the hard-core model become importent, w…
Planar maps whose second iterate has a unique fixed point
2007
Let a>0, F: R^2 -> R^2 be a differentiable (not necessarily C^1) map and Spec(F) be the set of (complex) eigenvalues of the derivative F'(p) when p varies in R^2. (a) If Spec(F) is disjoint of the interval [1,1+a[, then Fix(F) has at most one element, where Fix(F) denotes the set of fixed points of F. (b) If Spec(F) is disjoint of the real line R, then Fix(F^2) has at most one element. (c) If F is a C^1 map and, for all p belonging to R^2, the derivative F'(p) is neither a homothety nor has simple real eigenvalues, then Fix(F^2) has at most one element, provided that Spec(F) is disjoint of either (c1) the union of the number 0 with the intervals ]-\infty, -1] and [1,\infty[, or (c2) t…
On 2-(n^2,2n,2n-1) designs with three intersection numbers
2007
The simple incidence structure $${\mathcal{D}(\mathcal{A},2)}$$ , formed by the points and the unordered pairs of distinct parallel lines of a finite affine plane $${\mathcal{A}=(\mathcal{P}, \mathcal{L})}$$ of order n > 4, is a 2 --- (n 2,2n,2n---1) design with intersection numbers 0,4,n. In this paper, we show that the converse is true, when n ? 5 is an odd integer.
On symmetric nonlocal games
2013
Abstract Nonlocal games are used to display differences between the classical and quantum world. In this paper, we study symmetric XOR games, which form an important subset of nonlocal games. We give simple methods for calculating the classical and the quantum values for symmetric XOR games with one-bit input per player. We illustrate those methods with two examples. One example is an N -player game (due to Ardehali (1992) [3] ) that provides the maximum quantum-over-classical advantage. The second example comes from generalization of CHSH game by letting the referee to choose arbitrary symmetric distribution of players’ inputs.
On Codimension Growth of Finitely Generated Associative Algebras
1998
Abstract LetAbe a PI-algebra over a fieldF. We study the asymptotic behavior of the sequence of codimensionscn(A) ofA. We show that ifAis finitely generated overFthenInv(A)=limn→∞ c n (A) always exists and is an integer. We also obtain the following characterization of simple algebras:Ais finite dimensional central simple overFif and only ifInv(A)=dim=A.
On simple families of functions and their Legendrian mappings
2004
We study germs of $n$-parameter families of functions, that is, function-germs of the type $f : (\mathbb{R}^n \times \mathbb{R}, 0) \to (\mathbb{R}, 0)$ defined on the total space of the trivial bundle $ \mathbb{R}^n \times \mathbb{R} \to \mathbb{R}^n $. There is a natural notion of $V$-equivalence for such function-germs. We introduce the Young diagram of $n$-parameter families satisfying a non-degeneracy condition. We classify all such simple $n$-parameter families and give their versal deformations. This result has direct applications to contact and projective geometry.
A short proof of a theorem of Juhasz
2011
Abstract We give a simple proof of the increasing strengthening of Arhangelʼskii Theorem. Our proof naturally leads to a refinement of this result of Juhasz.
Rank structured approximation method for quasi--periodic elliptic problems
2016
We consider an iteration method for solving an elliptic type boundary value problem $\mathcal{A} u=f$, where a positive definite operator $\mathcal{A}$ is generated by a quasi--periodic structure with rapidly changing coefficients (typical period is characterized by a small parameter $\epsilon$) . The method is based on using a simpler operator $\mathcal{A}_0$ (inversion of $\mathcal{A}_0$ is much simpler than inversion of $\mathcal{A}$), which can be viewed as a preconditioner for $\mathcal{A}$. We prove contraction of the iteration method and establish explicit estimates of the contraction factor $q$. Certainly the value of $q$ depends on the difference between $\mathcal{A}$ and $\mathcal…
A note on the distance set problem in the plane
2001
We use a simple geometric-combinatorial argument to establish a quantitative relation between the generalized Hausdorff measure of a set and its distance set, extending a result originally due to Falconer.
A Vector Approach to Euler's Line of a Triangle
1992
Among the many interesting properties that triangles possess there is one that quickly attracts our curiosity and stays easily in our mind: The centroid, circumcentre and orthocentre all lie in a common line (Euler's Line). An elementary simple proof can be obtained using metric and affine properties of the points involved, [1]. Our aim here is to illustrate a proof using vectors. We identify points in the plane with their position vectors. It is easy to see that the centroid G of the triangle ABC is given by the identity