Search results for "LYN"

On the zeros of Jacobi polynomials

1994

Some Numerical Invariants of Multilinear Identities

2017

We consider non-necessarily associative algebras over a field of characteristic zero and their polynomial identities. Here we describe most of the results obtained in recent years on two numerical sequences that can be attached to the multilinear identities satisfied by an algebra: the sequence of codimensions and the sequence of colengths.

Varieties of algebras with pseudoinvolution: Codimensions, cocharacters and colengths

2022

Abstract Let A be a finitely generated superalgebra with pseudoinvolution ⁎ over an algebraically closed field F of characteristic zero. In this paper we develop a theory of polynomial identities for this kind of algebras . In particular, we shall consider three sequences that can be attached to Id ⁎ ( A ) , the T 2 ⁎ -ideal of identities of A: the sequence of ⁎-codimensions c n ⁎ ( A ) , the sequence of ⁎-cocharacter χ 〈 n 〉 ⁎ ( A ) and the ⁎-colength sequence l n ⁎ ( A ) . Our purpose is threefold. First we shall prove that the ⁎-codimension sequence is eventually non-decreasing, i.e., c n ⁎ ( A ) ≤ c n + 1 ⁎ ( A ) , for n large enough. Secondly, we study superalgebras with pseudoinvoluti…

A Collective Binomial Learning Methodology

2013

In second-language learning, learners frequently have a poor environment for speaking and hearing the target language. Learning efficiency is thus limited. We propose a methodology involving the creation of temporary social structures. Collective interactions fed back among individuals and environment are constructed on a computer and practiced in a real world. A dynamic learning system which coherently ties together the practitioner’s design, the learner’s performance and the researcher’s theories is possible. Our results call for language learning structures to include adaptive spoken structures, in contrast with existing educational systems.

Lynch Syndrome Genetics and Clinical Implications

2023

Lynch syndrome (LS) is one of the most prevalent hereditary cancer syndromes in humans and accounts for some 3% of unselected patients with colorectal or endometrial cancer and 10%-15% of those with DNA mismatch repair-deficient tumors. Previous studies have established the genetic basis of LS predisposition, but there have been significant advances recently in the understanding of the molecular pathogenesis of LS tumors, which has important implications in clinical management. At the same time, immunotherapy has revolu-tionized the treatment of advanced cancers with DNA mismatch repair defects. We aim to review the recent prog-ress in the LS field and discuss how the accumulating epidemiol…

Tangential Hilbert problem for perturbations of hyperelliptic Hamiltonian systems

1999

The tangential Hilbert 16th problem is to place an upper bound for the number of isolated ovals of algebraic level curves { H ( x , y ) = const } \{H(x,y)=\operatorname {const}\} over which the integral of a polynomial 1-form P ( x , y ) d x + Q ( x , y ) d y P(x,y)\,dx+Q(x,y)\,dy (the Abelian integral) may vanish, the answer to be given in terms of the degrees n = deg ⁡ H n=\deg H and d = max ( deg ⁡ P , deg ⁡ Q ) d=\max (\deg P,\deg Q) . We describe an algorithm producing this upper bound in the form of a primitive recursive (in fact, elementary) function of n n and d d for the particular case of hyperelliptic polynomials H ( x , y ) = y 2 + U ( x ) H(x,y)=y^2+U(x) under the additional as…

Permutation properties and the fibonacci semigroup

1989

On orderability of fibred knot groups

2003

It is known that knot groups are right-orderable, and that many of them are not bi-orderable. Here we show that certain bred knots in S 3 (or in a homology sphere) do have bi-orderable fundamental group. In particular, this holds for bred knots, such as 41, for which the Alexander polynomial has all roots real and positive. This is an application of the construction of orderings of groups, which are moreover invariant with respect to a certain automorphism.

Transitive factorizations in the hyperoctahedral group

2008

The classical Hurwitz enumeration problem has a presentation in terms of transitive factor- izationsin the symmetric group. This presentationsuggestsageneralizationfromtypeAto otherfinite reflection groups and, in particular, to type B.W e study this generalization both from ac ombinatorial and a geometric point of view, with the prospect of providing am eans of understanding more of the structure of the moduli spaces of maps with an S2-symmetry. The type A case has been well studied and connects Hurwitz numbers to the moduli space of curves. W ec onjecture an analogous setting for the type B case that is studied here. 1I ntroduction Transitive factorizations of permutations into transposit…

Boolean Functions of Low Polynomial Degree for Quantum Query Complexity Theory

2007

The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bounds on quantum algorithms. It has been an open problem whether this lower bound is tight. This is why Boolean functions are needed with a high number of essential variables and a low polynomial degree. Unfortunately, it is a well-known problem to construct such functions. The best separation between these two complexity measures of a Boolean function was exhibited by Ambai- nis [5]. He constructed functions with polynomial degree M and number of variables Omega(M2). We improve such a separation to become exponenti…