Equidissection is a mathematical concept related to the idea of dividing shapes into pieces in such a way that the pieces can be rearranged to form another shape of equal area or volume. It involves partitioning a geometric figure into smaller pieces that can be reconfigured without changing their size, typically to demonstrate equivalence in area or volume between different figures. One of the popular contexts for discussing equidissection is in geometry, specifically in polygonal and polyhedral dissections.

Looking for formats that:

Bibliography:

One specific software project, typically with a single executable file format entry point.

Programming is hard. To Ciro Santilli, it's almost masochistic.

What makes Ciro especially mad when programming is not the hard things.

It is the things that should be easy, but aren't, and which take up a lot of your programming time.

Especially when you are already a few levels of "simple problems" down from your original goal, and another one of them shows up.

This is basically the cause of Hofstadter's law.

But of course, it is because it is hard that it feels amazing when you achieve your goal.

Putting a complex and useful program together is like composing a symphony, or reaching the summit of a hard rock climbing proble.

Programming can be an art form. There can be great beauty in code and what it does. It is a shame that this is hard to see from within the walls of most companies, where you are stuck doing a small specific task as fast as possible.

If you have a PDE that models physical phenomena, it is fundamental that:

Unlike for ordinary differential equations which have the Picard–Lindelöf theorem, the existence and uniqueness of solution is not well solved for PDEs.

For example, Navier-Stokes existence and smoothness was one of the Millennium Prize Problems.

The Erdős–Diophantine graph is a concept in graph theory that arises in connection with number theory and combinatorics, particularly focusing on the relationships defined by some Diophantine properties. In this setting, the vertices of the graph typically represent natural numbers or integers, and edges are drawn based on a specific Diophantine condition. The most common version of the Erdős–Diophantine graph considers pairs of integers that satisfy a particular equation or set of equations.

Public landing page: www.ox.ac.uk/admissions/undergraduate/courses/course-listing/computer-science-and-philosophy

A mixed cross department course with the philosophy department. Its corresponding masters is known as Oxford MCompSciPhil. The handbook is together with the computer science one: Section "Computer science course of the University of Oxford".

The Hadwiger Conjecture is a significant statement in combinatorial geometry that relates to the coloring of the plane with respect to convex sets, particularly focusing on the properties of regions defined by convex shapes.

As mentioned at Section "Computer security researcher", Ciro Santilli really tends to like people from this area.

Also, the type of programming Ciro used to do, systems programming, is particularly useful to security researchers, e.g. Linux Kernel Module Cheat.

The reason he does not go into this is that Ciro would rather fight against the more eternal laws of physics rather than with some typo some dude at Apple did last week and which will be patched in a month.

It is said, that once upon a time, programmers used CSV and collaborated on SourceForge, and that everyone was happy.

These days, are however, long gone in the mists of time as of 2020, and beyond Ciro Santilli's programming birth.

Except for hardware developers of course. The are still happily using Perforce and Tcl, and shall never lose their innocence. Blessed be their souls. Amen.

An "integer triangle" typically refers to a triangle in which the lengths of all three sides are integers. For a triangle to exist with given side lengths, they must satisfy the triangle inequality theorem, which states that for any triangle with sides of lengths \( a \), \( b \), and \( c \): 1. \( a + b > c \) 2. \( a + c > b \) 3.

Two symmetric matrices $A$ and $B$ are defined to be congruent if there exists an $S$ in $GL(n)$ such that:

bbchallenge.org/story#what-is-known-about-bb lists some (all?) cool examples,

wiki.bbchallenge.org/wiki/Cryptids contains a larger list. In June 2024 it was discovered that BB(6) is hard.

The term "isosceles set" does not appear to be a widely recognized term in mathematics or any specific field. However, it might be a misinterpretation or a confusion with the term "isosceles triangle," which refers to a triangle that has two sides of equal length.

When a disconnected space is made up of several smaller connected spaces, then each smaller component is called a "connected component" of the larger space.

See for example the