نتایج جستجو برای: freeness

تعداد نتایج: 1223  

A. Golchin

In this paper firt of all we introduce a generalization of torsion freeness of acts over monoids, called -torsion freeness. Then in section 1 of results we give some general properties and in sections 2, 3 and 4 we give a characterization of monoids for which this property of their right Rees factor, cyclic and acts in general  implies some other properties, respectively.

Journal: :Journal of the Korean Mathematical Society 2008

2010
Ralf Küsters Henning Schnoor Tomasz Truderung

Abuse-freeness is an important security requirement for contract-signing protocols. In previous work, Kähler, Küsters, and Wilke proposed a definition for offline abuse-freeness. In this work, we generalize this definition to online abuse-freeness and apply it to two prominent contract-signing protocols. We demonstrate that online abuse-freeness is strictly stronger than offline abuse-freeness.

2008
Julien Cassaigne François Nicolas

This paper deals with the decidability of semigroup freeness. More precisely, the freeness problem over a semigroup S is defined as: given a finite subset X ⊆ S, decide whether each element of S has at most one factorization over X. To date, the decidabilities of two freeness problems have been closely examined. In 1953, Sardinas and Patterson proposed a now famous algorithm for the freeness pr...

Journal: :CoRR 2017
Orr Fischer Tzlil Gonen Rotem Oshman

In the subgraph-freeness problem, we are given a constant-size graph H, and wish to determine whether the network contains H as a subgraph or not. The property-testing relaxation of the problem only requires us to distinguish graphs that are H-free from graphs that are -far from H-free, in the sense that an -fraction of their edges must be removed to obtain an H-free graph. Recently, Censor-Hil...

2009
VLADIMIR DOTSENKO

We show how to use Gröbner bases for operads to prove various freeness theorems: freeness of certain operads as nonsymmetric operads, freeness of an operad Q as a P-module for an inclusion P ֒→ Q, freeness of a suboperad. This gives new proofs of many known results of this type and helps to prove some new results.

Journal: :RAIRO - Theor. Inf. and Applic. 2012
Julien Cassaigne François Nicolas

This paper deals with the decidability of semigroup freeness. More precisely, the freeness problem over a semigroup S is defined as: given a finite subset X ⊆ S, decide whether each element of S has at most one factorization over X. To date, the decidabilities of two freeness problems have been closely examined. In 1953, Sardinas and Patterson proposed a now famous algorithm for the freeness pr...

Journal: :JCP 2009
Bo Meng

The practical Internet voting protocols should have: privacy, completeness, soundness, unreusability, fairness, eligibility, and invariableness, universal verifiability, receipt-freeness, coercion-resistant. Receiptfreeness is a key property. Receipt-freeness means that the voter can't produce a receipt to prove that he votes a special ballot. Its purpose is to protect against vote buying. Form...

Journal: :journal of sciences, islamic republic of iran 2013
a. golchin

in this paper firt of all we introduce a generalization of torsion freeness of acts over monoids, called -torsion freeness. then in section 1 of results we give some general properties and in sections 2, 3 and 4 we give a characterization of monoids for which this property of their right rees factor, cyclic and acts in general  implies some other properties, respectively.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید