相关论文: Loops and the Lagrange property

Abstrct: In this note, by considering fractionally linear functions over a finite field and consequently developing an abstract sequence, we study some of its properties.

We first formulate an inverse problem for a linear fractional Lam\'e system. We determine the Lam\'e parameters from exterior partial measurements of the Dirichlet-to-Neumann map. We further study an inverse obstacle problem as well as an…

We prove that, for any pure morphic word $w$, if the frequencies of all letters in $w$ exist, then the frequencies of all factors in $w$ exist as well. This result answers a question of Saari in his doctoral thesis.

Automorphic loops are loops in which all inner mappings are automorphisms. This variety of loops includes groups and commutative Moufang loops. A half-isomorphism $f : G \longrightarrow K$ between multiplicative systems $G$ and $K$ is a…

We consider the logic space of countable (enumerated) groups and show that closed subspaces corresponding to some standard classes of groups have (do not have) generic groups. We also discuss the cases of semigroups and associative rings.

We look at spaces of infinite-by-infinite matrices, and consider closed subsets that are stable under simultaneous row and column operations. We prove that up to symmetry, any of these closed subsets is defined by finitely many equations.

Some aspects of basic category theory are developed in a finitely complete category $\C$, endowed with two factorization systems which determine the same discrete objects and are linked by a simple reciprocal stability law. Resting on this…

In conic linear programming -- in contrast to linear programming -- the Lagrange dual is not an exact dual: it may not attain its optimal value, or there may be a positive duality gap. The corresponding Farkas' lemma is also not exact (it…

Metacirculants are a rich resource of many families of interesting graphs, and weak metacirculants are generalizations of them. A graph is called a {\em split weak metacirculant} if it has a vertex-transitive split metacyclic automorphism…

We show that algebraic formulas and constant-depth circuits are closed under taking factors. In other words, we show that if a multivariate polynomial over a field of characteristic zero has a small constant-depth circuit or formula, then…

We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…

We consider special flows over the rotation on the circle by an irrational $\alpha$ under roof functions of bounded variation. The roof functions, in the Lebesgue decomposition, are assumed to have a continuous singular part coming from a…

A popular approximation in lattice gauge theory is an extrapolation in the number of fermion species away from the four fold degeneracy natural with the staggered fermions formulation. I show that at finite lattice spacing and for an odd…

Suppose that there's no transitive model of ZFC + there's a strong cardinal, and let K denote the core model. It is shown that if \delta has the tree property then \delta^{+K} = \delta^+ and \delta is weakly compact in K.

Root systems are sets with remarkable symmetries and therefore they appear in many situations in mathematics. Among others, denominator formulae of root systems are very beautiful and mysterious equations which have several meanings from a…

Moufang loops are one of the best-known generalizations of groups. There is only one countable family of nonassociative finite simple Moufang loops, arising from the split octonion algebras. We prove that every member of this family is…

A long standing problem in the area of error correcting codes asks whether there exist good cyclic codes. Most of the known results point in the direction of a negative answer. The uncertainty principle is a classical result of harmonic…

L. Soukup formulated an abstract framework in his introductory paper for proving theorems about uncountable graphs by subdividing them by an increasing continuous chain of elementary submodels. The applicability of this method relies on the…

A domain $R$ is said to have the finite factorization property if every nonzero non-unit element of $R$ has at least one and at most finitely many distinct factorizations up to multiplication of irreducible factors by central units. Let $k$…

We prove upper and lower bounds for certain sums of products of fractional parts by using majoring and minorizing functions from Fourier analysis. In special cases the upper bounds are sharp if there exist counterexamples to the Littlewood…