Discrete Mathematics Dec 2013 (2024)

Notice: Change to 4 digit year in URLs

ArXiv is updating URLs for the /list and /year paths to use 4 digit years: /YYYY for years and /YYYY-MM for months. Old paths will be redirected to the new correct forms where possible. Caution: /2002 no longer represents Feb 2020; it now represents the year 2002.

[1] arXiv:1312.1172 [pdf, other]

Title: Circular-arc hypergraphs: Rigidity via Connectedness

Johannes Köbler, Sebastian Kuhnert, Oleg Verbitsky

Comments: 21 pages, 8 figures

Subjects: Discrete Mathematics (cs.DM)

[2] arXiv:1312.1523 [pdf, other]

Title: Efficient construction of broadcast graphs

A. Averbuch, R. Hollander Shabtai, Y. Roditty

Comments: 19 pages, 3 figures. Submitted on January 10th 2012 to Applied Descrete Mathematics

Subjects: Discrete Mathematics (cs.DM)

[3] arXiv:1312.2209 [pdf, other]

Title: Construct Graph Logic

Yong Tan

Comments: 54 pages, 3 figures

Subjects: Discrete Mathematics (cs.DM); Combinatorics (math.CO)

[4] arXiv:1312.2222 [pdf, other]

Title: A Stability Result for Sparse Convolutions

Philipp Walk, Peter Jung

Comments: (i) minor revision of the text (ii) use definition of Freiman dimension as in [3] (iii) updated references

Subjects: Discrete Mathematics (cs.DM); Information Theory (cs.IT); Combinatorics (math.CO)

[5] arXiv:1312.2730 [pdf, other]

Title: Clique-Stable Set separation in perfect graphs with no balanced skew-partitions

Aurélie Lagoutte, Théophile Trunck

Comments: arXiv admin note: text overlap with arXiv:1308.6444

Journal-ref: Discrete Mathematics, 339(6):1809-1825, 2016

Subjects: Discrete Mathematics (cs.DM); Combinatorics (math.CO)

[6] arXiv:1312.2816 [pdf, other]

Title: The Complexity of Change

Jan van den Heuvel

Comments: 28 pages, 6 figures

Journal-ref: In: S.R. Blackburn, S. Gerke and M. Wildon (eds.), "Surveys in Combinatorics 2013". Cambridge UP, 2013

Subjects: Discrete Mathematics (cs.DM); Combinatorics (math.CO)

[7] arXiv:1312.2819 [pdf, other]

Title: Covering Partial Cubes with Zones

Jean Cardinal, Stefan Felsner

Subjects: Discrete Mathematics (cs.DM); Combinatorics (math.CO)

[8] arXiv:1312.2986 [pdf, other]

Title: Notes on discrepancy in the pairwise comparisons method

Konrad Kułakowski

Comments: 8 pages

Journal-ref: EJOR, Vol. 245, Issue 1, Pages 333 - 337, 2015

Subjects: Discrete Mathematics (cs.DM); Information Retrieval (cs.IR)

[9] arXiv:1312.3182 [pdf, other]

Title: On The Center Sets and Center Numbers of Some Graph Classes

Ram Kumar. R, Kannan Balakrishnan, Manoj Changat, A.Sreekumar, Prasanth G. Narasimha-Shenoi

Subjects: Discrete Mathematics (cs.DM); Combinatorics (math.CO)

[10] arXiv:1312.3444 [pdf, other]

Title: Some results of domination and total domination in the direct product of two fuzzy graphs

Pradip Debnath

Subjects: Discrete Mathematics (cs.DM)

[11] arXiv:1312.4066 [pdf, other]

Title: Emergence of wave patterns on Kadanoff Sandpiles

Kévin Perrot, Eric Rémila

Comments: 21 pages (including 9 pages of annexes). LATIN 2014. arXiv admin note: substantial text overlap with arXiv:1301.0997

Subjects: Discrete Mathematics (cs.DM)

[12] arXiv:1312.4101 [pdf, other]

Title: Trees and co-trees with constant maximum degree in planar 3-connected graphs

Therese Biedl

Subjects: Discrete Mathematics (cs.DM); Combinatorics (math.CO)

[13] arXiv:1312.4134 [pdf, other]

Title: The Generation of Minimal Tests Sets and Some Minimal Tests

Julia Brodskaya

Comments: 16 pages, in Russian

Subjects: Discrete Mathematics (cs.DM)

[14] arXiv:1312.4345 [pdf, other]

Title: An improved Branch-and-cut code for the maximum balanced subgraph of a signed graph

Rosa Figueiredo, Yuri Frota

Subjects: Discrete Mathematics (cs.DM); Data Structures and Algorithms (cs.DS)

[15] arXiv:1312.4398 [pdf, other]

Title: On the number of proper $k$-colorings in an $n$-gon

Shantanu Chhabra

Comments: 8 pages, 2 tables

Subjects: Discrete Mathematics (cs.DM)

[16] arXiv:1312.4429 [pdf, other]

Title: The Flip Diameter of Rectangulations and Convex Subdivisions

Eyal Ackerman, Michelle M. Allen, Gill Barequet, Maarten Löffler, Joshua Mermelstein, Diane L. Souvaine, Csaba D. Tóth

Comments: 17 pages, 12 figures, an extended abstract has been presented at LATIN 2014

Journal-ref: Discrete Mathematics & Theoretical Computer Science, Vol. 18 no. 3, Combinatorics (March 17, 2016) dmtcs:646

Subjects: Discrete Mathematics (cs.DM); Computational Geometry (cs.CG); Combinatorics (math.CO)

[17] arXiv:1312.4920 [pdf, other]

Title: Integer-ambiguity resolution in astronomy and geodesy

André Lannes (Supelec), Jean-Louis Prieur (UPS-OMP-IRAP)

Comments: 12 pages. Soumis et accepté pour publication dans "Astronomische Nachrichten"

Subjects: Discrete Mathematics (cs.DM); Instrumentation and Methods for Astrophysics (astro-ph.IM); Optimization and Control (math.OC)

[18] arXiv:1312.5067 [pdf, other]

Title: Rainbow path and color degree in edge colored graphs

Anita Das, P. Suresh, S. V. Subrahmanya

Comments: 4 pages

Subjects: Discrete Mathematics (cs.DM); Combinatorics (math.CO)

[19] arXiv:1312.5280 [pdf, other]

Title: Dichotomies properties on computational complexity of S-packing coloring problems

Nicolas Gastineau

Subjects: Discrete Mathematics (cs.DM); Computational Complexity (cs.CC); Combinatorics (math.CO)

[20] arXiv:1312.5505 [pdf, other]

Title: Optimal Combinatorial Batch Codes based on Block Designs

Natalia Silberstein, Anna Gál

Comments: Accepted for publication in Designs, Codes and Cryptography (Springer)

Subjects: Discrete Mathematics (cs.DM); Combinatorics (math.CO)

[21] arXiv:1312.5620 [pdf, other]

Title: Further results on strong edge-colourings in outerplanar graphs

Valentin Borozan, Leandro Montero, Narayanan Narayanan

Comments: 8 pages

Subjects: Discrete Mathematics (cs.DM); Combinatorics (math.CO)

[22] arXiv:1312.6447 [pdf, other]

Title: Incremental Network Design with Maximum Flows

Thomas Kalinowski, Dmytro Matsypura, Martin W.P. Savelsbergh

Comments: 26 pages

Journal-ref: European Journal of Operational Research 242 (2015), pp. 51-62

Subjects: Discrete Mathematics (cs.DM); Data Structures and Algorithms (cs.DS)

[23] arXiv:1312.6503 [pdf, other]

Title: On the family of $r$-regular graphs with Grundy number $r+1$

Nicolas Gastineau (Le2i, LIRIS), Hamamache Kheddouci (LIRIS), Olivier Togni (Le2i)

Subjects: Discrete Mathematics (cs.DM); Combinatorics (math.CO)

[24] arXiv:1312.7014 [pdf, other]

Title: On the Parameterized Complexity of Computing Balanced Partitions in Graphs

René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondřej Suchý

Comments: This version of the article is to appear in Theory of Computing Systems

Journal-ref: Theory of Computing Systems 57(1):1-35, 2015

Subjects: Discrete Mathematics (cs.DM); Data Structures and Algorithms (cs.DS); Combinatorics (math.CO)

[25] arXiv:1312.7253 [pdf, other]

Title: Complexity Results for Rainbow Matchings

Van Bang Le, Florian Pfender

Comments: To appear in Theoretical Computer Science

Subjects: Discrete Mathematics (cs.DM); Combinatorics (math.CO)

Discrete Mathematics Dec 2013 (2024)

FAQs

Is discrete math considered hard? ›

Discrete math to me is a hard discipline. We are now starting permutations, combinations, and the Binomial theorem. Its not as hard as induction was.

Is discrete math high level? ›

Some high-school-level discrete mathematics textbooks have appeared as well. At this level, discrete mathematics is sometimes seen as a preparatory course, like precalculus in this respect.

What are the topics in discrete math PDF? ›

These topics include: Logic, Counting Methods, Relation and Function, Recurrence Relation and Generating Function, Introduction to Graph Theory And Group Theory, Lattice Theory and Boolean Algebra etc.

What is discrete math and its applications content? ›

It deals with objects that can have distinct separate values. It is also called Decision Mathematics or finite Mathematics. It is the study of mathematical structures that are fundamentally discrete in nature and it does not require the notion of continuity.

Which is harder linear algebra or discrete math? ›

Is Linear Algebra A Hard Subject? Many students regard linear algebra as a difficult study. It is more challenging than discrete mathematics which is usually a first-year program taught in most STEM majors. Linear algebra is taught in its second year and demands robust reasoning and analytical skills.

What is the hardest math class? ›

The hardest math classes in high school are typically pre-calculus, Calculus, Algebra I, and II, and some advanced math concepts like statistics and trigonometry.

Is discrete math pure math? ›

The coursework for applied math focuses can also lead many students to practical fields like computer and data science, mechanical engineering or finance and accounting.In contrast, the coursework for a degree in pure mathematics often focuses on topics in abstract algebra, discrete mathematics, complex variables, ...

Is discrete math considered advanced math? ›

Discrete math — together with calculus and abstract algebra — is one of the core components of mathematics at the undergraduate level. Students who learn a significant quantity of discrete math before entering college will be at a significant advantage when taking undergraduate-level math courses.

What majors use discrete math? ›

Description
  • Computer Science.
  • Data Science.
  • Actuarial Science.
  • Financial Mathematics.
  • Cryptography.
  • Engineering.
  • Computer Graphics.
  • Economics.

Is discrete math above calculus? ›

16 Mathematics after Calculus

A third key direction is discrete mathematics. Matrices are a part, networks and algorithms are a bigger part. Derivatives are not a part-this is closer to algebra.

How to pass discrete mathematics? ›

Make flash cards for definitions when necessary. Learn properties, theorems, and formulas. Again, make flash cards when necessary. Make notes and questions in margins and be sure to bring to class to discuss the material.

What branch of math is discrete math? ›

Discrete mathematics is the mathematical language of computer science, and as such, its importance has increased dramatically in recent decades. The related branch of mathematics known as concrete mathematics, while having some overlap with discrete mathematics, includes a quite different set of topics (Graham et al.

What is discrete math used for in real life? ›

Discrete structures such as finite fields and combinatorial designs are employed to ensure reliable data transmission and storage. Combinatorics deals with counting, arrangement, and combination of objects. It is widely used in cryptography, error-correcting codes, scheduling algorithms, and optimization problems.

What is discrete math in layman's terms? ›

Discrete Mathematics is the branch of Mathematics in which we deal with questions involving finite or countably infinite sets. In particular this means that the numbers involved are either integers, or numbers closely related to them, such as fractions or 'modular' numbers.

What does discrete math teach you? ›

About this course

Broadly speaking, discrete math is math that uses discrete numbers, or integers, meaning there are no fractions or decimals involved. In this course, you'll learn about proofs, binary, sets, sequences, induction, recurrence relations, and more!

What math is considered hard? ›

Real Analysis: This course is sometimes referred to as the most difficult undergraduate math course because it delves deep into the theoretical foundations of calculus. It relies heavily on rigorous proofs and demands a high level of abstract thinking.

Do you need to be good at calculus for discrete math? ›

Do you need calculus for discrete math? No. So, go ahead and take that huge sigh of relief — I know you want to.

Top Articles
Latest Posts
Article information

Author: Lakeisha Bayer VM

Last Updated:

Views: 5603

Rating: 4.9 / 5 (69 voted)

Reviews: 92% of readers found this page helpful

Author information

Name: Lakeisha Bayer VM

Birthday: 1997-10-17

Address: Suite 835 34136 Adrian Mountains, Floydton, UT 81036

Phone: +3571527672278

Job: Manufacturing Agent

Hobby: Skimboarding, Photography, Roller skating, Knife making, Paintball, Embroidery, Gunsmithing

Introduction: My name is Lakeisha Bayer VM, I am a brainy, kind, enchanting, healthy, lovely, clean, witty person who loves writing and wants to share my knowledge and understanding with you.