Logic Programming
 
Assignment - Combinatorics

Do at least one of the following problems. Your choice which to do.

(1) Write a logic program that defines the binary relation , where the first argument is a set and the second argument is its power set (i.e. the set of all of its subsets). You can assume that the elements of the "input" are object constants (e.g. , , , and so forth) and that the "input" is a list with no duplicates (e.g. ). Your "output" should be a list of the subsets of the "input" (e.g. ). Your program should succeed on all queries in which the first argument to is a ground set in list notation and the second argument is a variable.

(2) Write a logic program that defines the binary relation , where the first argument is a list and the second argument is a list of its permutations. You can assume that the elements of the "input" are object constants (e.g. , , , and so forth) and that the "input" is a list with no duplicates (e.g. ). Your output should be a list of permutations (e.g. ). Your program should succeed on all queries in which the first argument to is a ground set in list notation and the second argument is a variable.

Stack Exchange Network

Stack Exchange network consists of 183 Q&A communities including Stack Overflow , the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

Q&A for work

Connect and share knowledge within a single location that is structured and easy to search.

Assignment problem for forming pairs of real numbers

Suppose I have two sets of real numbers, $X$ and $Y$ , each of cardinality $N$ . I would like to assign these points to pairs $(X_i, Y_j)$ such that the sum of squared intra-pair distances is minimized. One option is to use the Hungarian algorithm with complexity $O(N^3)$ , forming a cost matrix with all the squared distances between $X$ elements and $Y$ elements. Another option is to solve this approximately in $O(N log N)$ using a K-D tree. But is there any method that is faster than cubic (perhaps quadratic) but better than the K-D tree approach?

The fact that these are one-dimensional real numbers suggests we could somehow exploit the fact that we can sort the numbers. For example, we could sort each set of numbers and pair the elements with the same rank order. If this makes things any easier, I don't need to work with squared distances necessarily; sum of absolute distances would work too.

  • co.combinatorics

calmcc's user avatar

2 Answers 2

Suppose the $X,Y$ are sorted. Then $X_1$ (the smallest $X$ -value) must always be matched with $Y_1$ (the smallest $Y$ -value). (Why? If you consider some other pairing, say one that includes $(X_1,Y_j)$ and $(X_i,Y_1)$ , then changing those two pairs to $(X_1,Y_1)$ and $(X_i,Y_j)$ yields a lower-cost pairing. I'll let you prove this. The case analysis is not too difficult.)

Continuing onward, we see that you can sort the $X$ and $Y$ and then match $(X_i,Y_i)$ for each $i$ , to obtain the optimal solution.

Thus, the problem can be solved in $O(N \log N)$ time.

D.W.'s user avatar

It turns out the sorting idea is at the core of the sliced Wasserstein distance for approximating the true Wasserstein distance (which requires either solving a linear assignment problem or running the Sinkhorn algorithm) with 1d projections. See the following paper for more details:

Bonneel, Nicolas, et al. "Sliced and radon wasserstein barycenters of measures." Journal of Mathematical Imaging and Vision 51 (2015): 22-45.

Your Answer

Sign up or log in, post as a guest.

Required, but never shown

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy .

Not the answer you're looking for? Browse other questions tagged co.combinatorics or ask your own question .

  • Featured on Meta
  • Introducing an accessibility dashboard and some upcoming changes to display...
  • We've made changes to our Terms of Service & Privacy Policy - July 2024
  • Announcing a change to the data-dump process

Hot Network Questions

  • Do comets ever run out of water?
  • Permutations of the natural numbers with a common conditionally convergent series
  • Earliest example of space travel involving interdimensional 'shortcuts'
  • Special generating sets of the additive group of rational numbers
  • how to decode privatekey into bs58 acceptable by wallets?
  • Direct limits in homotopy category
  • Communicate the intention to resign
  • Automatically closing a water valve after a few minutes
  • Using newcommand with textbf inside table environment
  • Why does electromagnetic and weak force get stronger at high energies and other way around for strong force?
  • What does "contradictions trivialize truth" mean?
  • Why is "a black belt in Judo" a metonym?
  • Looking for a story about a colonized solar system that has asteroid belts but no habitable planet
  • What does it mean to echo multiple strings into a UNIX pipe?
  • Is the word ekklesia ever used to describe unbelievers?
  • What is the meaning of 'in the note'?
  • When can a citizen's arrest of an Interpol fugitive be legal in Washington D.C.?
  • Strategies for handling Maternity leave the last two weeks of the semester
  • Shift right by half a trit
  • Why did Borland ignore the Macintosh market?
  • Counting them 100 years later
  • Why isn't the Liar's Paradox just accepted to be complete nonsense?
  • Zsh: enable extended_glob inline in a filename generation glob
  • Flow Decision Passing when it should fail

assignment problem in combinatorics

Browse Course Material

Course info.

  • Prof. Alexander Postnikov

Departments

  • Mathematics

As Taught In

  • Algebra and Number Theory
  • Discrete Mathematics

Learning Resource Types

Algebraic combinatorics, lecture notes.

facebook

You are leaving MIT OpenCourseWare

  • Search Menu

Sign in through your institution

  • Browse content in Arts and Humanities
  • Browse content in Archaeology
  • Anglo-Saxon and Medieval Archaeology
  • Archaeological Methodology and Techniques
  • Archaeology by Region
  • Archaeology of Religion
  • Archaeology of Trade and Exchange
  • Biblical Archaeology
  • Contemporary and Public Archaeology
  • Environmental Archaeology
  • Historical Archaeology
  • History and Theory of Archaeology
  • Industrial Archaeology
  • Landscape Archaeology
  • Mortuary Archaeology
  • Prehistoric Archaeology
  • Underwater Archaeology
  • Zooarchaeology
  • Browse content in Architecture
  • Architectural Structure and Design
  • History of Architecture
  • Residential and Domestic Buildings
  • Theory of Architecture
  • Browse content in Art
  • Art Subjects and Themes
  • History of Art
  • Industrial and Commercial Art
  • Theory of Art
  • Biographical Studies
  • Byzantine Studies
  • Browse content in Classical Studies
  • Classical History
  • Classical Philosophy
  • Classical Mythology
  • Classical Numismatics
  • Classical Literature
  • Classical Reception
  • Classical Art and Architecture
  • Classical Oratory and Rhetoric
  • Greek and Roman Epigraphy
  • Greek and Roman Law
  • Greek and Roman Papyrology
  • Greek and Roman Archaeology
  • Late Antiquity
  • Religion in the Ancient World
  • Social History
  • Digital Humanities
  • Browse content in History
  • Colonialism and Imperialism
  • Diplomatic History
  • Environmental History
  • Genealogy, Heraldry, Names, and Honours
  • Genocide and Ethnic Cleansing
  • Historical Geography
  • History by Period
  • History of Emotions
  • History of Agriculture
  • History of Education
  • History of Gender and Sexuality
  • Industrial History
  • Intellectual History
  • International History
  • Labour History
  • Legal and Constitutional History
  • Local and Family History
  • Maritime History
  • Military History
  • National Liberation and Post-Colonialism
  • Oral History
  • Political History
  • Public History
  • Regional and National History
  • Revolutions and Rebellions
  • Slavery and Abolition of Slavery
  • Social and Cultural History
  • Theory, Methods, and Historiography
  • Urban History
  • World History
  • Browse content in Language Teaching and Learning
  • Language Learning (Specific Skills)
  • Language Teaching Theory and Methods
  • Browse content in Linguistics
  • Applied Linguistics
  • Cognitive Linguistics
  • Computational Linguistics
  • Forensic Linguistics
  • Grammar, Syntax and Morphology
  • Historical and Diachronic Linguistics
  • History of English
  • Language Acquisition
  • Language Evolution
  • Language Reference
  • Language Variation
  • Language Families
  • Lexicography
  • Linguistic Anthropology
  • Linguistic Theories
  • Linguistic Typology
  • Phonetics and Phonology
  • Psycholinguistics
  • Sociolinguistics
  • Translation and Interpretation
  • Writing Systems
  • Browse content in Literature
  • Bibliography
  • Children's Literature Studies
  • Literary Studies (Asian)
  • Literary Studies (European)
  • Literary Studies (Eco-criticism)
  • Literary Studies (Romanticism)
  • Literary Studies (American)
  • Literary Studies (Modernism)
  • Literary Studies - World
  • Literary Studies (1500 to 1800)
  • Literary Studies (19th Century)
  • Literary Studies (20th Century onwards)
  • Literary Studies (African American Literature)
  • Literary Studies (British and Irish)
  • Literary Studies (Early and Medieval)
  • Literary Studies (Fiction, Novelists, and Prose Writers)
  • Literary Studies (Gender Studies)
  • Literary Studies (Graphic Novels)
  • Literary Studies (History of the Book)
  • Literary Studies (Plays and Playwrights)
  • Literary Studies (Poetry and Poets)
  • Literary Studies (Postcolonial Literature)
  • Literary Studies (Queer Studies)
  • Literary Studies (Science Fiction)
  • Literary Studies (Travel Literature)
  • Literary Studies (War Literature)
  • Literary Studies (Women's Writing)
  • Literary Theory and Cultural Studies
  • Mythology and Folklore
  • Shakespeare Studies and Criticism
  • Browse content in Media Studies
  • Browse content in Music
  • Applied Music
  • Dance and Music
  • Ethics in Music
  • Ethnomusicology
  • Gender and Sexuality in Music
  • Medicine and Music
  • Music Cultures
  • Music and Religion
  • Music and Media
  • Music and Culture
  • Music Education and Pedagogy
  • Music Theory and Analysis
  • Musical Scores, Lyrics, and Libretti
  • Musical Structures, Styles, and Techniques
  • Musicology and Music History
  • Performance Practice and Studies
  • Race and Ethnicity in Music
  • Sound Studies
  • Browse content in Performing Arts
  • Browse content in Philosophy
  • Aesthetics and Philosophy of Art
  • Epistemology
  • Feminist Philosophy
  • History of Western Philosophy
  • Metaphysics
  • Moral Philosophy
  • Non-Western Philosophy
  • Philosophy of Science
  • Philosophy of Language
  • Philosophy of Mind
  • Philosophy of Perception
  • Philosophy of Action
  • Philosophy of Law
  • Philosophy of Religion
  • Philosophy of Mathematics and Logic
  • Practical Ethics
  • Social and Political Philosophy
  • Browse content in Religion
  • Biblical Studies
  • Christianity
  • East Asian Religions
  • History of Religion
  • Judaism and Jewish Studies
  • Qumran Studies
  • Religion and Education
  • Religion and Health
  • Religion and Politics
  • Religion and Science
  • Religion and Law
  • Religion and Art, Literature, and Music
  • Religious Studies
  • Browse content in Society and Culture
  • Cookery, Food, and Drink
  • Cultural Studies
  • Customs and Traditions
  • Ethical Issues and Debates
  • Hobbies, Games, Arts and Crafts
  • Natural world, Country Life, and Pets
  • Popular Beliefs and Controversial Knowledge
  • Sports and Outdoor Recreation
  • Technology and Society
  • Travel and Holiday
  • Visual Culture
  • Browse content in Law
  • Arbitration
  • Browse content in Company and Commercial Law
  • Commercial Law
  • Company Law
  • Browse content in Comparative Law
  • Systems of Law
  • Competition Law
  • Browse content in Constitutional and Administrative Law
  • Government Powers
  • Judicial Review
  • Local Government Law
  • Military and Defence Law
  • Parliamentary and Legislative Practice
  • Construction Law
  • Contract Law
  • Browse content in Criminal Law
  • Criminal Procedure
  • Criminal Evidence Law
  • Sentencing and Punishment
  • Employment and Labour Law
  • Environment and Energy Law
  • Browse content in Financial Law
  • Banking Law
  • Insolvency Law
  • History of Law
  • Human Rights and Immigration
  • Intellectual Property Law
  • Browse content in International Law
  • Private International Law and Conflict of Laws
  • Public International Law
  • IT and Communications Law
  • Jurisprudence and Philosophy of Law
  • Law and Politics
  • Law and Society
  • Browse content in Legal System and Practice
  • Courts and Procedure
  • Legal Skills and Practice
  • Legal System - Costs and Funding
  • Primary Sources of Law
  • Regulation of Legal Profession
  • Medical and Healthcare Law
  • Browse content in Policing
  • Criminal Investigation and Detection
  • Police and Security Services
  • Police Procedure and Law
  • Police Regional Planning
  • Browse content in Property Law
  • Personal Property Law
  • Restitution
  • Study and Revision
  • Terrorism and National Security Law
  • Browse content in Trusts Law
  • Wills and Probate or Succession
  • Browse content in Medicine and Health
  • Browse content in Allied Health Professions
  • Arts Therapies
  • Clinical Science
  • Dietetics and Nutrition
  • Occupational Therapy
  • Operating Department Practice
  • Physiotherapy
  • Radiography
  • Speech and Language Therapy
  • Browse content in Anaesthetics
  • General Anaesthesia
  • Browse content in Clinical Medicine
  • Acute Medicine
  • Cardiovascular Medicine
  • Clinical Genetics
  • Clinical Pharmacology and Therapeutics
  • Dermatology
  • Endocrinology and Diabetes
  • Gastroenterology
  • Genito-urinary Medicine
  • Geriatric Medicine
  • Infectious Diseases
  • Medical Toxicology
  • Medical Oncology
  • Pain Medicine
  • Palliative Medicine
  • Rehabilitation Medicine
  • Respiratory Medicine and Pulmonology
  • Rheumatology
  • Sleep Medicine
  • Sports and Exercise Medicine
  • Clinical Neuroscience
  • Community Medical Services
  • Critical Care
  • Emergency Medicine
  • Forensic Medicine
  • Haematology
  • History of Medicine
  • Browse content in Medical Dentistry
  • Oral and Maxillofacial Surgery
  • Paediatric Dentistry
  • Restorative Dentistry and Orthodontics
  • Surgical Dentistry
  • Browse content in Medical Skills
  • Clinical Skills
  • Communication Skills
  • Nursing Skills
  • Surgical Skills
  • Medical Ethics
  • Medical Statistics and Methodology
  • Browse content in Neurology
  • Clinical Neurophysiology
  • Neuropathology
  • Nursing Studies
  • Browse content in Obstetrics and Gynaecology
  • Gynaecology
  • Occupational Medicine
  • Ophthalmology
  • Otolaryngology (ENT)
  • Browse content in Paediatrics
  • Neonatology
  • Browse content in Pathology
  • Chemical Pathology
  • Clinical Cytogenetics and Molecular Genetics
  • Histopathology
  • Medical Microbiology and Virology
  • Patient Education and Information
  • Browse content in Pharmacology
  • Psychopharmacology
  • Browse content in Popular Health
  • Caring for Others
  • Complementary and Alternative Medicine
  • Self-help and Personal Development
  • Browse content in Preclinical Medicine
  • Cell Biology
  • Molecular Biology and Genetics
  • Reproduction, Growth and Development
  • Primary Care
  • Professional Development in Medicine
  • Browse content in Psychiatry
  • Addiction Medicine
  • Child and Adolescent Psychiatry
  • Forensic Psychiatry
  • Learning Disabilities
  • Old Age Psychiatry
  • Psychotherapy
  • Browse content in Public Health and Epidemiology
  • Epidemiology
  • Public Health
  • Browse content in Radiology
  • Clinical Radiology
  • Interventional Radiology
  • Nuclear Medicine
  • Radiation Oncology
  • Reproductive Medicine
  • Browse content in Surgery
  • Cardiothoracic Surgery
  • Gastro-intestinal and Colorectal Surgery
  • General Surgery
  • Neurosurgery
  • Paediatric Surgery
  • Peri-operative Care
  • Plastic and Reconstructive Surgery
  • Surgical Oncology
  • Transplant Surgery
  • Trauma and Orthopaedic Surgery
  • Vascular Surgery
  • Browse content in Science and Mathematics
  • Browse content in Biological Sciences
  • Aquatic Biology
  • Biochemistry
  • Bioinformatics and Computational Biology
  • Developmental Biology
  • Ecology and Conservation
  • Evolutionary Biology
  • Genetics and Genomics
  • Microbiology
  • Molecular and Cell Biology
  • Natural History
  • Plant Sciences and Forestry
  • Research Methods in Life Sciences
  • Structural Biology
  • Systems Biology
  • Zoology and Animal Sciences
  • Browse content in Chemistry
  • Analytical Chemistry
  • Computational Chemistry
  • Crystallography
  • Environmental Chemistry
  • Industrial Chemistry
  • Inorganic Chemistry
  • Materials Chemistry
  • Medicinal Chemistry
  • Mineralogy and Gems
  • Organic Chemistry
  • Physical Chemistry
  • Polymer Chemistry
  • Study and Communication Skills in Chemistry
  • Theoretical Chemistry
  • Browse content in Computer Science
  • Artificial Intelligence
  • Computer Architecture and Logic Design
  • Game Studies
  • Human-Computer Interaction
  • Mathematical Theory of Computation
  • Programming Languages
  • Software Engineering
  • Systems Analysis and Design
  • Virtual Reality
  • Browse content in Computing
  • Business Applications
  • Computer Security
  • Computer Games
  • Computer Networking and Communications
  • Digital Lifestyle
  • Graphical and Digital Media Applications
  • Operating Systems
  • Browse content in Earth Sciences and Geography
  • Atmospheric Sciences
  • Environmental Geography
  • Geology and the Lithosphere
  • Maps and Map-making
  • Meteorology and Climatology
  • Oceanography and Hydrology
  • Palaeontology
  • Physical Geography and Topography
  • Regional Geography
  • Soil Science
  • Urban Geography
  • Browse content in Engineering and Technology
  • Agriculture and Farming
  • Biological Engineering
  • Civil Engineering, Surveying, and Building
  • Electronics and Communications Engineering
  • Energy Technology
  • Engineering (General)
  • Environmental Science, Engineering, and Technology
  • History of Engineering and Technology
  • Mechanical Engineering and Materials
  • Technology of Industrial Chemistry
  • Transport Technology and Trades
  • Browse content in Environmental Science
  • Applied Ecology (Environmental Science)
  • Conservation of the Environment (Environmental Science)
  • Environmental Sustainability
  • Environmentalist Thought and Ideology (Environmental Science)
  • Management of Land and Natural Resources (Environmental Science)
  • Natural Disasters (Environmental Science)
  • Nuclear Issues (Environmental Science)
  • Pollution and Threats to the Environment (Environmental Science)
  • Social Impact of Environmental Issues (Environmental Science)
  • History of Science and Technology
  • Browse content in Materials Science
  • Ceramics and Glasses
  • Composite Materials
  • Metals, Alloying, and Corrosion
  • Nanotechnology
  • Browse content in Mathematics
  • Applied Mathematics
  • Biomathematics and Statistics
  • History of Mathematics
  • Mathematical Education
  • Mathematical Finance
  • Mathematical Analysis
  • Numerical and Computational Mathematics
  • Probability and Statistics
  • Pure Mathematics
  • Browse content in Neuroscience
  • Cognition and Behavioural Neuroscience
  • Development of the Nervous System
  • Disorders of the Nervous System
  • History of Neuroscience
  • Invertebrate Neurobiology
  • Molecular and Cellular Systems
  • Neuroendocrinology and Autonomic Nervous System
  • Neuroscientific Techniques
  • Sensory and Motor Systems
  • Browse content in Physics
  • Astronomy and Astrophysics
  • Atomic, Molecular, and Optical Physics
  • Biological and Medical Physics
  • Classical Mechanics
  • Computational Physics
  • Condensed Matter Physics
  • Electromagnetism, Optics, and Acoustics
  • History of Physics
  • Mathematical and Statistical Physics
  • Measurement Science
  • Nuclear Physics
  • Particles and Fields
  • Plasma Physics
  • Quantum Physics
  • Relativity and Gravitation
  • Semiconductor and Mesoscopic Physics
  • Browse content in Psychology
  • Affective Sciences
  • Clinical Psychology
  • Cognitive Psychology
  • Cognitive Neuroscience
  • Criminal and Forensic Psychology
  • Developmental Psychology
  • Educational Psychology
  • Evolutionary Psychology
  • Health Psychology
  • History and Systems in Psychology
  • Music Psychology
  • Neuropsychology
  • Organizational Psychology
  • Psychological Assessment and Testing
  • Psychology of Human-Technology Interaction
  • Psychology Professional Development and Training
  • Research Methods in Psychology
  • Social Psychology
  • Browse content in Social Sciences
  • Browse content in Anthropology
  • Anthropology of Religion
  • Human Evolution
  • Medical Anthropology
  • Physical Anthropology
  • Regional Anthropology
  • Social and Cultural Anthropology
  • Theory and Practice of Anthropology
  • Browse content in Business and Management
  • Business Strategy
  • Business Ethics
  • Business History
  • Business and Government
  • Business and Technology
  • Business and the Environment
  • Comparative Management
  • Corporate Governance
  • Corporate Social Responsibility
  • Entrepreneurship
  • Health Management
  • Human Resource Management
  • Industrial and Employment Relations
  • Industry Studies
  • Information and Communication Technologies
  • International Business
  • Knowledge Management
  • Management and Management Techniques
  • Operations Management
  • Organizational Theory and Behaviour
  • Pensions and Pension Management
  • Public and Nonprofit Management
  • Social Issues in Business and Management
  • Strategic Management
  • Supply Chain Management
  • Browse content in Criminology and Criminal Justice
  • Criminal Justice
  • Criminology
  • Forms of Crime
  • International and Comparative Criminology
  • Youth Violence and Juvenile Justice
  • Development Studies
  • Browse content in Economics
  • Agricultural, Environmental, and Natural Resource Economics
  • Asian Economics
  • Behavioural Finance
  • Behavioural Economics and Neuroeconomics
  • Econometrics and Mathematical Economics
  • Economic Systems
  • Economic History
  • Economic Methodology
  • Economic Development and Growth
  • Financial Markets
  • Financial Institutions and Services
  • General Economics and Teaching
  • Health, Education, and Welfare
  • History of Economic Thought
  • International Economics
  • Labour and Demographic Economics
  • Law and Economics
  • Macroeconomics and Monetary Economics
  • Microeconomics
  • Public Economics
  • Urban, Rural, and Regional Economics
  • Welfare Economics
  • Browse content in Education
  • Adult Education and Continuous Learning
  • Care and Counselling of Students
  • Early Childhood and Elementary Education
  • Educational Equipment and Technology
  • Educational Strategies and Policy
  • Higher and Further Education
  • Organization and Management of Education
  • Philosophy and Theory of Education
  • Schools Studies
  • Secondary Education
  • Teaching of a Specific Subject
  • Teaching of Specific Groups and Special Educational Needs
  • Teaching Skills and Techniques
  • Browse content in Environment
  • Applied Ecology (Social Science)
  • Climate Change
  • Conservation of the Environment (Social Science)
  • Environmentalist Thought and Ideology (Social Science)
  • Management of Land and Natural Resources (Social Science)
  • Natural Disasters (Environment)
  • Pollution and Threats to the Environment (Social Science)
  • Social Impact of Environmental Issues (Social Science)
  • Sustainability
  • Browse content in Human Geography
  • Cultural Geography
  • Economic Geography
  • Political Geography
  • Browse content in Interdisciplinary Studies
  • Communication Studies
  • Museums, Libraries, and Information Sciences
  • Browse content in Politics
  • African Politics
  • Asian Politics
  • Chinese Politics
  • Comparative Politics
  • Conflict Politics
  • Elections and Electoral Studies
  • Environmental Politics
  • Ethnic Politics
  • European Union
  • Foreign Policy
  • Gender and Politics
  • Human Rights and Politics
  • Indian Politics
  • International Relations
  • International Organization (Politics)
  • Irish Politics
  • Latin American Politics
  • Middle Eastern Politics
  • Political Methodology
  • Political Communication
  • Political Philosophy
  • Political Sociology
  • Political Behaviour
  • Political Economy
  • Political Institutions
  • Political Theory
  • Politics and Law
  • Politics of Development
  • Public Administration
  • Public Policy
  • Qualitative Political Methodology
  • Quantitative Political Methodology
  • Regional Political Studies
  • Russian Politics
  • Security Studies
  • State and Local Government
  • UK Politics
  • US Politics
  • Browse content in Regional and Area Studies
  • African Studies
  • Asian Studies
  • East Asian Studies
  • Japanese Studies
  • Latin American Studies
  • Middle Eastern Studies
  • Native American Studies
  • Scottish Studies
  • Browse content in Research and Information
  • Research Methods
  • Browse content in Social Work
  • Addictions and Substance Misuse
  • Adoption and Fostering
  • Care of the Elderly
  • Child and Adolescent Social Work
  • Couple and Family Social Work
  • Direct Practice and Clinical Social Work
  • Emergency Services
  • Human Behaviour and the Social Environment
  • International and Global Issues in Social Work
  • Mental and Behavioural Health
  • Social Justice and Human Rights
  • Social Policy and Advocacy
  • Social Work and Crime and Justice
  • Social Work Macro Practice
  • Social Work Practice Settings
  • Social Work Research and Evidence-based Practice
  • Welfare and Benefit Systems
  • Browse content in Sociology
  • Childhood Studies
  • Community Development
  • Comparative and Historical Sociology
  • Disability Studies
  • Economic Sociology
  • Gender and Sexuality
  • Gerontology and Ageing
  • Health, Illness, and Medicine
  • Marriage and the Family
  • Migration Studies
  • Occupations, Professions, and Work
  • Organizations
  • Population and Demography
  • Race and Ethnicity
  • Social Theory
  • Social Movements and Social Change
  • Social Research and Statistics
  • Social Stratification, Inequality, and Mobility
  • Sociology of Religion
  • Sociology of Education
  • Sport and Leisure
  • Urban and Rural Studies
  • Browse content in Warfare and Defence
  • Defence Strategy, Planning, and Research
  • Land Forces and Warfare
  • Military Administration
  • Military Life and Institutions
  • Naval Forces and Warfare
  • Other Warfare and Defence Issues
  • Peace Studies and Conflict Resolution
  • Weapons and Equipment

Combinatorics: A Very Short Introduction

  • < Previous chapter
  • Next chapter >

Combinatorics: A Very Short Introduction

2 (page 7) p. 7 Four types of problem

  • Published: April 2016
  • Cite Icon Cite
  • Permissions Icon Permissions

‘Four types of problem’ explains that combinatorics is concerned with four types of problem: existence problems (does x exist?); construction problems (if x exists, how can we construct it?); enumeration problems (how many x are there?); and optimization problems (which x is best?). Existence problems discussed include tilings, placing dominoes on a chess board, the knight’s tour problem, the Königsberg bridges problem, the Gas–Water–Electricity problem, and the map-colour problem. Construction problems include solving mazes, and the two types of enumeration problems considered are counting problems and listing problems. Examples of an optimization problem include the minimum connector problem and the travelling salesman problem. The efficiency of algorithms is also explained.

Personal account

  • Sign in with email/username & password
  • Get email alerts
  • Save searches
  • Purchase content
  • Activate your purchase/trial code
  • Add your ORCID iD

Institutional access

Sign in with a library card.

  • Sign in with username/password
  • Recommend to your librarian
  • Institutional account management
  • Get help with access

Access to content on Oxford Academic is often provided through institutional subscriptions and purchases. If you are a member of an institution with an active account, you may be able to access content in one of the following ways:

IP based access

Typically, access is provided across an institutional network to a range of IP addresses. This authentication occurs automatically, and it is not possible to sign out of an IP authenticated account.

Choose this option to get remote access when outside your institution. Shibboleth/Open Athens technology is used to provide single sign-on between your institution’s website and Oxford Academic.

  • Click Sign in through your institution.
  • Select your institution from the list provided, which will take you to your institution's website to sign in.
  • When on the institution site, please use the credentials provided by your institution. Do not use an Oxford Academic personal account.
  • Following successful sign in, you will be returned to Oxford Academic.

If your institution is not listed or you cannot sign in to your institution’s website, please contact your librarian or administrator.

Enter your library card number to sign in. If you cannot sign in, please contact your librarian.

Society Members

Society member access to a journal is achieved in one of the following ways:

Sign in through society site

Many societies offer single sign-on between the society website and Oxford Academic. If you see ‘Sign in through society site’ in the sign in pane within a journal:

  • Click Sign in through society site.
  • When on the society site, please use the credentials provided by that society. Do not use an Oxford Academic personal account.

If you do not have a society account or have forgotten your username or password, please contact your society.

Sign in using a personal account

Some societies use Oxford Academic personal accounts to provide access to their members. See below.

A personal account can be used to get email alerts, save searches, purchase content, and activate subscriptions.

Some societies use Oxford Academic personal accounts to provide access to their members.

Viewing your signed in accounts

Click the account icon in the top right to:

  • View your signed in personal account and access account management features.
  • View the institutional accounts that are providing access.

Signed in but can't access content

Oxford Academic is home to a wide variety of products. The institutional subscription may not cover the content that you are trying to access. If you believe you should have access to that content, please contact your librarian.

For librarians and administrators, your personal account also provides access to institutional account management. Here you will find options to view and activate subscriptions, manage institutional settings and access options, access usage statistics, and more.

Our books are available by subscription or purchase to libraries and institutions.

Month: Total Views:
October 2022 3
November 2022 4
December 2022 5
January 2023 2
February 2023 2
March 2023 3
April 2023 1
May 2023 3
June 2023 1
August 2023 5
September 2023 6
October 2023 6
November 2023 4
December 2023 7
January 2024 2
February 2024 4
April 2024 2
May 2024 5
June 2024 4
July 2024 2
  • About Oxford Academic
  • Publish journals with us
  • University press partners
  • What we publish
  • New features  
  • Open access
  • Rights and permissions
  • Accessibility
  • Advertising
  • Media enquiries
  • Oxford University Press
  • Oxford Languages
  • University of Oxford

Oxford University Press is a department of the University of Oxford. It furthers the University's objective of excellence in research, scholarship, and education by publishing worldwide

  • Copyright © 2024 Oxford University Press
  • Cookie settings
  • Cookie policy
  • Privacy policy
  • Legal notice

This Feature Is Available To Subscribers Only

Sign In or Create an Account

This PDF is available to Subscribers Only

For full access to this pdf, sign in to an existing account, or purchase an annual subscription.

Problem-Solving Strategies for solving Combinatorics Assignments

Lauren Nelson

Embarking on the journey of conquering combinatorics assignments requires more than just mathematical prowess. Combinatorics, a captivating branch of mathematics dealing with the art of counting and arrangement, demands a strategic approach and a solid foundation in various concepts. As you embark on your journey to tackle assignments in combinatorics, it's crucial to have a solid understanding of fundamental topics and effective problem-solving strategies. In this blog, we will delve into the critical topics that lay the groundwork for successful combinatorics assignments and explore effective strategies to help with your Combinatorics assignment in this intricate field.

Understanding the Basics of Combinatorics

Before delving into more complex concepts, it's essential to grasp the foundational ideas in combinatorics. These concepts serve as building blocks for solving more intricate problems later on. Here are a few key topics you should familiarize yourself with:

Comprehensive Guide to Doing Your Combinatorics Assignments

Permutations and Combinations

Permutations involve arranging objects in a specific order, while combinations focus on selecting objects without considering the order. Understanding the formulas for permutations and combinations is crucial.

The Multiplication Principle

The multiplication principle, also known as the counting principle, helps you count the total number of outcomes for multiple tasks performed sequentially. It's a fundamental concept that underlies many combinatorial problems.

The Addition Principle

The addition principle allows you to count the total number of outcomes for tasks that can be performed in different ways or cases. It's particularly useful for solving problems involving choices or alternatives.

Advanced Topics for Combinatorics Assignments

Once you have a solid grasp of the basics, you can move on to more advanced topics that will enhance your ability to tackle complex combinatorics assignments.

Binomial Theorem and Pascal's Triangle

Understanding the binomial theorem and Pascal's Triangle can be immensely beneficial. These concepts are often used to expand binomial expressions and calculate combinations efficiently.

Inclusion-Exclusion Principle

The inclusion-exclusion principle helps solve problems involving multiple sets or conditions. It's a powerful tool for counting elements that satisfy certain criteria while considering overlaps.

Generating Functions

Generating functions provide a formal way to represent sequences of numbers, making it easier to solve problems involving recurrence relations and counting.

Pigeonhole Principle

The pigeonhole principle might seem intuitive, but it has deep implications in combinatorics. It helps you recognize when there must be repetitions or patterns in a given set of objects.

Strategies for Solving Combinatorics Assignments

Equipped with a solid understanding of the essential and advanced topics in combinatorics, let's dive into strategies for approaching and solving assignments effectively.

Understand the Problem Statement

Understanding the problem statement is the crucial first step in navigating the world of combinatorics assignments. It involves dissecting the given scenario, deciphering the information provided, and grasping the specific task you need to accomplish. This initial comprehension sets the stage for effective problem-solving.

To truly understand the problem, read it multiple times, identifying key details, constraints, and requirements. Rephrasing the problem in your own words can often clarify its essence. Break down any complex sentences or scenarios into simpler components. This process helps you avoid misinterpretations and ensures you are addressing the problem accurately.

A solid grasp of the problem statement guides your approach. It helps you determine whether permutations, combinations, or other principles are applicable. Without this foundational understanding, attempting to solve the problem can lead to confusion and errors.

Remember, a well-defined problem is halfway solved. Take your time, analyze the information provided, and ensure you're clear on what's being asked. This practice not only enhances your problem-solving skills in combinatorics but also cultivates a mindset that's attentive, analytical, and detail-oriented – qualities that extend beyond mathematics into various facets of problem-solving in the real world.

Visualize the Problem

In the realm of combinatorics, where abstract concepts meet real-world scenarios, visualization becomes an invaluable tool. Many combinatorial problems involve arranging objects, making choices, or following specific sequences. Visualizing the problem allows you to create a mental or graphical representation of the situation, which can provide insights and clarity.

When faced with a combinatorial problem, consider creating diagrams, tables, or even simple models to represent the elements involved. For example, if you're dealing with a permutation problem where you need to arrange people in a queue, you can sketch out a line with placeholders for each person. Visual aids like this help you see patterns, repetitions, or symmetries that might not be immediately apparent from the problem statement alone.

Visualizing the problem doesn't just make it more tangible; it also guides your thought process. As you work on assignments, remember that a clear mental image or a visual representation on paper can lead you to potential solutions more efficiently. Combining mathematical analysis with visual insight allows you to approach problems from multiple angles, increasing your chances of finding an elegant and accurate solution.

Break Down the Problem

Combinatorics problems, especially complex ones, can seem overwhelming at first glance. Breaking down the problem into smaller, manageable components is a powerful strategy to tackle the challenge systematically. This approach not only makes the problem more approachable but also helps you identify patterns and connections that might not be obvious initially.

Start by analyzing the problem statement and identifying its key elements. What are the given values, constraints, and requirements? Then, consider if you can divide the problem into sub-problems or cases. Each sub-problem can be addressed independently, simplifying the overall solution process.

Additionally, breaking down the problem often involves recognizing similarities between different parts of the problem. If you encounter repetitive tasks or scenarios, you can solve one instance and then generalize the solution for others.

By deconstructing the problem, you transform a complex challenge into a series of manageable steps. This approach not only reduces the risk of overlooking crucial details but also boosts your confidence as you steadily work through each component. As you gain experience, you'll become more skilled at identifying how to break down problems effectively, enhancing your problem-solving prowess in combinatorics.

Apply Relevant Concepts

When faced with a combinatorics problem, applying the appropriate concepts is akin to selecting the right tools for a task. Each problem has unique characteristics, and understanding which principles, theorems, or formulas are relevant is crucial. This step requires a deep understanding of the concepts you've studied, so take the time to review and internalize them.

For instance, if the problem involves arranging objects in a specific order, permutations are likely the key. On the other hand, if the order doesn't matter, combinations come into play. Similarly, problems that involve sequential tasks might call for the multiplication principle. By carefully analyzing the problem statement and identifying its underlying structure, you can confidently choose the relevant combinatorial approach.

Double-Check Your Solution

While the sense of accomplishment from finding a solution is undeniable, it's equally important to exercise caution and rigor in your approach. The intricate nature of combinatorial problems leaves room for errors, oversights, or miscalculations. This is where the art of double-checking steps in.

Revisiting your solution with a critical eye helps ensure its accuracy. Verify whether you've accurately applied the chosen concept, whether calculations are error-free, and if your solution aligns with the problem's requirements. Moreover, assessing your solution from different angles can reveal potential shortcuts or alternative methods, leading to a more elegant solution.

The process of double-checking fosters a sense of confidence in your solution and helps you catch any slips that might have otherwise gone unnoticed. Remember, precision is paramount in combinatorics, where small mistakes can lead to vastly different outcomes. By making double-checking an integral part of your problem-solving routine, you're bound to refine your skills and produce consistently reliable solutions.

Practice, Practice, Practice

Practice lies at the heart of mastering combinatorics assignments. As with any skill, consistent practice is essential for honing your problem-solving abilities in this field. Combinatorics problems come in various forms, each presenting unique challenges. By working through a diverse range of problems, you develop a deeper understanding of the underlying concepts and strategies required.

Repetition allows you to internalize the methods used to approach different scenarios. It enhances your ability to recognize patterns, apply relevant principles, and make connections between seemingly unrelated problems. Through practice, you not only improve your technical skills but also gain the confidence to tackle even the most complex combinatorial puzzles.

Remember that it's not just about the quantity of problems you solve, but the quality of your engagement with each one. Analyze your solutions critically, identifying areas for improvement and alternative approaches. With every problem you conquer, you're building a mental toolkit that equips you to face new challenges with resilience and creativity.

Seek Help When Needed

In the realm of combinatorics, seeking help is not a sign of weakness, but a testament to your commitment to understanding and solving problems effectively. When you encounter a particularly challenging or perplexing problem, don't hesitate to reach out for assistance.

Consult your textbooks, online resources, or course materials to gain alternative perspectives on the problem. Sometimes, a fresh explanation can provide the clarity you need to unlock the solution. Engage with peers, teachers, or online communities to discuss the problem. Explaining your thought process to others often leads to insights you might have missed on your own.

Collaboration is a powerful tool in mastering combinatorics. A fellow student might approach a problem from a different angle, offering you a novel way to solve it. By seeking help, you're tapping into a wealth of collective knowledge, fostering a collaborative learning environment, and expanding your problem-solving toolkit.

Remember, the willingness to ask for help demonstrates your dedication to understanding and growing within the field of combinatorics. It's a trait that sets you on a path to becoming a more proficient and confident problem solver.

In conclusion, embarking on the realm of combinatorics assignments is a journey that combines mathematical acumen with strategic thinking. By establishing a strong foundation in fundamental concepts such as permutations, combinations, and the core principles of counting, you lay the groundwork for confidently approaching problems. As you delve into more advanced topics like the inclusion-exclusion principle, generating functions, and Pascal's Triangle, you unlock the tools to tackle even the most intricate combinatorial challenges. Remember, success in combinatorics assignments is not solely about equations and formulas; it's about cultivating a problem-solving mindset. Break down complex problems, visualize scenarios, and apply relevant principles. Mistakes and hurdles are part of the process – learn from them, iterate, and refine your approach.

Combinatorics assignments offer not only mathematical satisfaction but also the opportunity to hone critical thinking and analytical skills that transcend mathematics. So, whether you're arranging objects or counting possibilities, the journey through combinatorics equips you with skills that extend far beyond the classroom, enriching your problem-solving toolkit for a lifetime. Embrace the challenges, persist in your practice, and master the art of counting and arrangement with confidence.

Post a comment...

Problem-solving strategies for solving combinatorics assignments submit your assignment, attached files.

File Actions

Stack Exchange Network

Stack Exchange network consists of 183 Q&A communities including Stack Overflow , the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

Q&A for work

Connect and share knowledge within a single location that is structured and easy to search.

NP completeness of a variant of assignment problem

I have the following variant of assignment problem:

Suppose we have $m$ machines and $n$ jobs. Each machine is capable of doing a subset of jobs and each machine $i$ has capacity $C_i$ . Each job $j$ has a load of $D_j$ and the goal is to find if there exists a satisfying assignment where each job is assigned to one machine and no machine's load exceeds its capacity.

Hence the input is: $m$ positive numbers $C_1,...,C_m$ , $n$ positive numbers $D_1,...,D_n$ and the knowledge of whether machine $i$ is capable of job $j$ for all $i,j$ .

This variant is a bit different from original assignment problem as now each machine is only capable of a certain subset of jobs. I personally believe it is NP complete, however, I am not able to prove it...

  • combinatorics
  • optimization
  • computational-complexity
  • np-complete

Joe's user avatar

  • $\begingroup$ When you say "each machine is capable of doing a subset of jobs," do you mean that each machine is tasked with some number of the $n$ jobs, or that each machine has its own subset of the jobs which it is able to perform? $\endgroup$ –  Stephen Donovan Commented Jul 23, 2021 at 5:48
  • $\begingroup$ This looks like it can be solved with Min-Cost MaxFlow: en.wikipedia.org/wiki/Minimum-cost_flow_problem $\endgroup$ –  Sudix Commented Jul 23, 2021 at 15:51
  • 1 $\begingroup$ @Sudix minimum-cost flow might violate the "each job is assigned to one machine" rule. $\endgroup$ –  RobPratt Commented Jul 23, 2021 at 17:29

You must log in to answer this question.

Browse other questions tagged combinatorics optimization algorithms computational-complexity np-complete ..

  • Upcoming Events
  • 2024 Community Moderator Election ends in 9 days
  • Featured on Meta
  • We've made changes to our Terms of Service & Privacy Policy - July 2024
  • Introducing an accessibility dashboard and some upcoming changes to display...
  • Upcoming Moderator Election
  • 2024 Community Moderator Election

Hot Network Questions

  • What is the meaning of 'in the note'?
  • What is the lowest feasible depth for lightly-armed military submarines designed around the 1950s-60s?
  • When can a citizen's arrest of an Interpol fugitive be legal in Washington D.C.?
  • section numbers in PDF outline
  • Flashlight and 6 batteries
  • Sci-fi/horror anthology TV episode featuring a man and a woman waking up and restarting events repeatedly
  • Can an elf and a firbolg breed?
  • How can electrons hop large distances if they are connected to the atom which is stationary in an lattice?
  • Embedding rank of finite groups and quotients
  • Why is "a black belt in Judo" a metonym?
  • Is there a limit to how much power could be transmitted wirelessly?
  • How can damage be quantified in a game-agnostic way?
  • Lightning protection for steel tower
  • how to replace Info with Emacs
  • Zsh: enable extended_glob inline in a filename generation glob
  • I'm 78 and 57 years ago I was a 1 dan. Started karate at 5. I quit karate at 21 for reasons. Want to start again. Do not remember much. What do I do.?
  • Operator-precedence calculator in C
  • Is Marisa Tomei in the film the Toxic Avenger?
  • Can't find this type of matrix in any index. It's the Jacobian of a non linear ODE system, and each row has only two row-specific values.
  • What counts as a pet?
  • Why does electromagnetic and weak force get stronger at high energies and other way around for strong force?
  • I stopped an interview because I couldn't solve some difficult problems involving technology I haven't used in years. What could I have done instead?
  • HTTPs compression, CSRF and mobile apps
  • Is the word ekklesia ever used to describe unbelievers?

assignment problem in combinatorics

IMAGES

  1. Soln1

    assignment problem in combinatorics

  2. Solution of Assignment 6

    assignment problem in combinatorics

  3. UNIT 5 Combinatorics Unit Assignment 1 .pdf

    assignment problem in combinatorics

  4. A2-Combinatorics

    assignment problem in combinatorics

  5. How to solve combinatorics problems

    assignment problem in combinatorics

  6. COMBINATORICS. PROBLEM SET 7. PARTITIONS II Seminar problems

    assignment problem in combinatorics

COMMENTS

  1. Assignments

    18.212 S19 Algebraic Combinatorics, Problem Set 2 Solutions II. pdf. 226 kB 18.212 S19 Algebraic Combinatorics, Problem set 3. pdf. 200 kB ... assignment Problem Sets. Download Course. Over 2,500 courses & materials Freely sharing knowledge with learners and educators around the world.

  2. PDF Combinatorics and Probability

    We shall study combinatorics, or "counting," by presenting a sequence of increas-ingly more complex situations, each of which is represented by a simple paradigm problem. For each problem, we derive a formula that lets us determine the number of possible outcomes. The problems we study are: Counting assignments (Section 4.2).

  3. Problem Set 1

    Most of the problems are assigned from the required textbook Bona, Miklos. A Walk Through Combinatorics: An Introduction to Enumeration and Graph Theory. World Scientific Publishing Company, 2011. ISBN: 9789814335232. [Preview with Google Books] A problem marked by * is difficult; it is not necessary to solve such a problem to do well in the ...

  4. combinatorics

    An alternative approach is solve a transportation problem in the original network, with a (variable) supply in $[1,4]$ for each parent node, and a demand of at most $1$ per child. You can use a network flow solver or a linear programming solver.

  5. Algebraic Combinatorics

    This course covers the applications of algebra to combinatorics. Topics include enumeration methods, permutations, partitions, partially ordered sets and lattices, Young tableaux, graph theory, matrix tree theorem, electrical networks, convex polytopes, and more. ... assignment Problem Sets. Rhombille tiling—a tessellation of identical 60 ...

  6. PDF 7 OPEN PROBLEMS IN COMBINATORICS Problem 1 x

    7 OPEN PROBLEMS IN COMBINATORICS. ulexijxjk → xikxij + xjkxikfor. < j < kin any order until unable to d. so. For example, for x = x12x23x24, we havex12x23x24 → x13x12x24 + x23. 13x24 → x13x14x12 + x13x24x14 + x23x13x24.(A) Show that the number of terms N(x) in the final result depends only on monomial x and does not depend on the.

  7. Art of Problem Solving

    1. 1950 AHSME Problems/Problem 45. 1963 AHSME Problems/Problem 27. 1973 AHSME Problems/Problem 2. 1974 AHSME Problems/Problem 24. 1974 AHSME Problems/Problem 3. 1980 AHSME Problems/Problem 20. 1985 AJHSME Problems/Problem 15. 1985 AJHSME Problems/Problem 22.

  8. Assignment

    Assignment - Combinatorics. Assignment - Combinatorics. Do at least one of the following problems. Your choice which to do. (1) Write a logic program that defines the binary relation powerset, where the first argument is a set and the second argument is its power set (i.e. the set of all of its subsets).

  9. co.combinatorics

    It turns out the sorting idea is at the core of the sliced Wasserstein distance for approximating the true Wasserstein distance (which requires either solving a linear assignment problem or running the Sinkhorn algorithm) with 1d projections. See the following paper for more details:

  10. combinatorics

    The objective can be similarly formulated as the standard assignment problem. Compared to the standard assignment problem, the main difference is that in the first constraint the sum is taken over a given set of agents instead of over all agents.

  11. combinatorics

    There are two important cases: (a) K > (R choose M) and (b) K < (R chooses M). Case (a) actually reduces to case (b), so we only have to consider case (b). Of course, there are some constraints that make the assignment a bit challenging. We would like to have an even distribution of the number of candidates reviewed by each referee.

  12. Lecture Notes

    18.212 S19 Algebraic Combinatorics, Lecture 8: Grassmannians over finite fields. pdf. 201 kB. 18.212 S19 Algebraic Combinatorics, Lecture 9: Sets and multisets. Statistics on permutations. MIT OpenCourseWare is a web based publication of virtually all MIT course content. OCW is open and available to the world and is a permanent MIT activity.

  13. Combinatorial Analysis

    Freely sharing knowledge with learners and educators around the world. Learn more. This course analyzes combinatorial problems and methods for their solution. Topics include: enumeration, generating functions, recurrence relations, construction of bijections, introduction to graph theory, network algorithms, and extremal combinatorics.

  14. combinatorics

    1. +50. Suppose that when the assignment ui → vj u i → v j is made, the assignment uk → vp u k → v p becomes forbidden. There is a symmetry then, because if the assignment uk → vp u k → v p is made, it cannot have been forbidden, and so we know assignment ui → vj u i → v j is impossible. We can express this situation, where two ...

  15. Four types of problem

    Abstract 'Four types of problem' explains that combinatorics is concerned with four types of problem: existence problems (does x exist?); construction problems (if x exists, how can we construct it?); enumeration problems (how many x are there?); and optimization problems (which x is best?). Existence problems discussed include tilings, placing dominoes on a chess board, the knight's ...

  16. Problem-Solving Strategies for solving Combinatorics Assignments

    Lauren is a reliable and professional combinatorics assignment helper with a masters in pure mathematics from Harvard University. She has helped over 700 students score top grades. ... Combinatorics problems, especially complex ones, can seem overwhelming at first glance. Breaking down the problem into smaller, manageable components is a ...

  17. The Combinatorial Assignment Problem: Approximate Competitive

    Combinatorial assignment is one feature removed from several well-known market design problems. It is like a combinatorial auction prob-lem except for the restriction against monetary transfers.3 It differs from a matching problem in that preferences are one-sided: objects do not have preferences over the agents.4 It generalizes the house ...

  18. combinatorics

    The relaxed problem however is an ordinary linear programming problems and may be solved efficiently. Specialized software for mixed integer problems may be able to solve also the full problem efficiently. Problems of this form with $|A|, |B| = O(10^2)$ can be solved in under 1 second in R using the lpSolve package.

  19. Assignments

    Assignments. The problem sets (PDF) are a list of problems for practice. A subset of these problems will be designated as to-be-turned in. Only the designated problems are required to be submitted. Bonus problems, marked by ★, are more challenging. A grade of A- may be attained by only solving the non-starred problems.

  20. 18.212 S19 Algebraic Combinatorics, Problem Set 3 solutions

    18.212 S19 Algebraic Combinatorics, Problem Set 3 solutions Download File DOWNLOAD. Course Info Instructor Prof. Alexander Postnikov; Departments Mathematics; As Taught In ... assignment Problem Sets. Download Course. Over 2,500 courses & materials Freely sharing knowledge with learners and educators around the world.

  21. combinatorics

    0. I have the following variant of assignment problem: Suppose we have m m machines and n n jobs. Each machine is capable of doing a subset of jobs and each machine i i has capacity Ci C i. Each job j j has a load of Dj D j and the goal is to find if there exists a satisfying assignment where each job is assigned to one machine and no machine's ...