Results 261 to 270 of about 4,608 (301)

Effect of creep-feeding supplementation during the pre-weaning phase on gene co-expression in Longissimus thoracis muscle of F1 Angus x Nellore calves at weaning. [PDF]

open access: yesPLoS One
Reolon HG   +10 more
europepmc   +1 more source

Freeness of partial words

open access: yesTheoretical Computer Science, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Florin Manea, Robert Mercaş
exaly   +3 more sources

The freeness problem over matrix semigroups and bounded languages [PDF]

open access: yesInformation and Computation, 2014
peer reviewedWe study the freeness problem for matrix semigroups. We show that the freeness problem is decidable for upper-triangular 2 × 2 matrices with rational entries when the products are restricted to certain bounded ...
Emilie Charlier, Juha Honkala
exaly   +2 more sources
Some of the next articles are maybe not open access.

Related searches:

ON THE UNDECIDABILITY OF FREENESS OF MATRIX SEMIGROUPS

International Journal of Algebra and Computation, 1999
We slightly improve the result of Klarner, Birget and Satterfield, showing that the freeness of finitely presented multiplicative semigroups of 3×3 matrices over ℕ is undecidable even for triangular matrices. This is achieved by proving a new variant of Post correspondence problem. We also consider the freeness problem for 2×2 matrices.
Julien Cassaigne   +2 more
openaire   +2 more sources

ON THE FREENESS OF 3-ARRANGEMENTS

Bulletin of the London Mathematical Society, 2005
The author considers the freeness of hyperplane arrangements in a 3-dimensional space. A hyperplane arrangement \(A\) in an \(l\)-dimensional linear space is free, with exponents \(\exp(A) = (1=d_1, d_2, \ldots, d_l)\), if the associated module of all logarithmic vector fields is free with basis \(\delta_1, \ldots, \delta_l\), such that \(\deg \delta_i
openaire   +1 more source

Triangle-Freeness is Hard to Detect

Combinatorics, Probability and Computing, 2002
We show that recognizing the K3-freeness and K4-freeness of graphs is hard, respectively, for two-player nondeterministic communication protocols using exponentially many partitions and for nondeterministic syntactic read-r times branching programs.The key ingredient is a generalization of a colouring lemma, due to Papadimitriou and Sipser, which ...
Stasys Jukna, Georg Schnitger
openaire   +2 more sources

Continuity, freeness, and filtrations

Journal of Applied Non-Classical Logics, 2010
The role played by continuous morphisms in propositional modal logic is investigated: it turns out that they are strictly related to filtrations and to suitable variants of the notion of a free alg...
openaire   +1 more source

A Hopf Algebra Freeness Theorem

American Journal of Mathematics, 1989
The authors prove the conjecture that every finite-dimensional Hopf algebra H over a field k is a free (left or right) module over any Hopf subalgebra B. This was first proved by the second author in the case when \(B=kG\), G the group of group-like elements, is semi-simple [J.
Nichols, Warren D., Zoeller, M. Bettina
openaire   +1 more source

On the pseudo-freeness and the CDH assumption

International Journal of Information Security, 2009
The notion of pseudo-free group was first introduced by Hohenberger (Master’s thesis, EECS Dept., MIT, 2003). Rivest (TCC 2004. LNCS 2951, 505–521, 2004) formalized it and showed that several standard cryptographic assumptions hold on pseudo-free groups, such as the RSA assumption, the strong RSA assumption and the discrete logarithm assumption. Rivest
Shingo Hasegawa   +3 more
openaire   +1 more source

Home - About - Disclaimer - Privacy