Results 261 to 270 of about 1,304,856 (308)
Some of the next articles are maybe not open access.

On total coloring the direct product of cycles and bipartite direct product of graphs

Discrete Mathematics, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
C M H de Figueiredo, C S R Patrão
exaly   +2 more sources

Pseudo-t-norms and implication operators: direct products and direct product decompositions

Fuzzy Sets and Systems, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhudeng Wang, Yandong Yu
exaly   +3 more sources

On Balancing of a Direct Product.

open access: yes, 2009
A direct product of two sequences is a naturally defined sequence on the alphabet of pairs of symbols. By taking inspiration from [Pavel Salimov. On uniform recurrence of a direct product. In AutoMathA, 2009], where the author investigates the case of uniformly recurrent words, here, we study when the product of two balanced sequences on binary ...
Restivo A, ROSONE, GIOVANNA
core   +3 more sources

Hypercubes As Direct Products

SIAM Journal on Discrete Mathematics, 2005
Summary: Let \(G\) be a connected bipartite graph. An involution \(\alpha\) of \(G\) that preserves the bipartition of \(G\) is called bipartite. Let \(G^\alpha\) be the graph obtained from \(G\) by adding to \(G\) the natural perfect matching induced by \(\alpha\). We show that the \(k\)-cube \(Q_{k}\) is isomorphic to the direct product \(G \times H\)
Bostjan Bresar   +3 more
openaire   +2 more sources

Direct Product Testing

2014 IEEE 29th Conference on Computational Complexity (CCC), 2014
A direct product function is a function of the form g(x_1, ldots, x_k)=(g_1(x_1), ldots, g_k(x_k)). We show that the direct product property is locally testable with two queries, that is, a canonical two-query test distinguishes between direct product functions and functions that are far from direct products with constant probability.
Irit Dinur, David Steurer
openaire   +2 more sources

A direct product theorem

Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory, 2002
Gives a general setting in which the complexity (or quality) of solving two independent problems is the product of the associated individual complexities. The authors then derive from this setting several concrete results of this type for decision trees and communication complexity. >
Russell Impagliazzo   +2 more
openaire   +1 more source

Submodules of direct products

Commentarii mathematici Universitatis Sancti Pauli = Rikkyo Daigaku sugaku zasshi, 1987
Denote a (countable) direct product of Euclidean domains by \(\Pi\) (viewed both as a ring as well as its underlying additive group), the additive subgroup of \(\Pi\), \({\mathbb{Z}}\)-generated by all the characteristic elements of \(\Pi\) by B, and, by \(\omega\), a subring of \(\Pi\) which contains B. The authors study the \(\omega\)-pure submodules
J.M., Irwin, S.A., Khabbaz
openaire   +2 more sources

On direct products of theories

Journal of Symbolic Logic, 1952
This paper deals with the notion of direct product in the theory of decision problems.Elementary mathematical theories are always concerned with certain functions defined in a set I (called the universe of discourse of the theory) and certain relations with the common domain I.
openaire   +2 more sources

Direct summands of products

Archiv der Mathematik, 2002
Let \(R\) be a ring. All modules considered are right modules. A module \(M\) is said to be (finitely) product-rigid if any (finitely presented) direct summand of a product of copies of \(M\) having a local endomorphism ring is isomorphic to some indecomposable direct summand of \(M\) itself.
openaire   +4 more sources

A note on direct products

Journal of Symbolic Logic, 1958
By an algebra is meant an ordered set Γ = 〈V,R1, …, Rn, O1, …, Om〉, where V is a class, Ri (1 ≤ i ≤, n) is a relation on nj elements of V (i.e. Ri ⊆ Vni), and Oj (1 ≤ i ≤ n) is an operation on elements of V such that Oj(x1, … xmj) ∈ V) for all x1, …, xmj ∈ V).
openaire   +1 more source

Home - About - Disclaimer - Privacy