HALF-FACTORIAL SETS IN ELEMENTARY p-GROUPS WOLFGANG A. SCHMID Abstract. Let G be an abelian group. A subset G0 of G is called halffactorial, if the block monoid over G0 is a half-factorial monoid. In this article we inve

Source URL: www.uni-graz.at

DATA ANALYSIS THE DATA.TABLE WAY The official Cheat Sheet for the DataCamp course “Take DT, subset rows using i, then calculate j grouped by by” General form: DT[i, j, by]

Source URL: s3.amazonaws.com

Applied Research and Innovation Branch Feasibility Study of Developing and Creating a Standardized Subset of Bridge Plans

Source URL: ntl.bts.gov

THE STRUCTURE OF POPULAR DIFFERENCE SETS J. WOLF Abstract. We show that the set of popular differences of a large subset of ZN does not always contain the complete difference set of another large set. For this purpose we

Source URL: www.juliawolf.org

A quadratic lower bound for subset sums Matt DeVos Luis Goddyn∗ ˇamal§¶ Robert S´

Source URL: iti.mff.cuni.cz

POLYNOMIAL-TIME DATA REDUCTION FOR THE SUBSET INTERCONNECTION DESIGN PROBLEM† JIEHUA CHEN‡ , CHRISTIAN KOMUSIEWICZ‡ , ROLF NIEDERMEIER‡ , ˇ ´ § , AND MATHIAS WELLER¶ MANUEL SORGE‡ , ONDREJ

Source URL: fpt.akt.tu-berlin.de

Second theorem Today all theories are assumed to be nice. Notation Let A be an L-structure. If b is a tuple in A and B is any subset of A, we will write tpA (b/B) for the type in LB realized by b.

Source URL: staff.fnwi.uva.nl

The VLDB Journal:103–128 DOIs00778z REGULAR PAPER Sampling from repairs of conditional functional dependency

Source URL: cs.uwaterloo.ca

• Mathematics
• Mathematical logic
• Data modeling
• Functional dependency
• Permutation
• Equivalence relation
• Cardinal number
• Cardinality
• Tuple
• Subset
• Structure

EXCHANGEABLE MEASURES FOR SUBSHIFTS J. Aaronson, H. Nakada and O. Sarig Abstract. Let Ω be a Borel subset of S N where S is countable. A measure is called exchangeable on Ω, if it is supported on Ω and is invarian

Source URL: www.wisdom.weizmann.ac.il

Homework #1 in Design and Analysis of Algorithms Question 1 Recall that a clique in a graph G = (V, E) is a subset C ⊆ V such that there is an edge between every pair of vertices in C. A maximum clique is a clique with

Source URL: www.eng.tau.ac.il