arxiv.org/abs/2501.12132v1
Maximally embedding dimension (MED) numerical semigroups are a wide and interesting family, with some remarkable algebraic and combinatorial properties. Associated to any numerical semigroup one can construct a MED closure, as it is well known. This...
arxiv.org/abs/1110.5272v1
Snakes are analogues of alternating permutations defined for any Coxeter group. We study these objects from the point of view of combinatorial Hopf algebras, such as noncommutative symmetric functions and their generalizations. The main purpose is to...
arxiv.org/abs/2312.04446v4
This paper explores the Lipschitz geometric and combinatorial properties of germs of real semialgebraic surfaces (or, more generally, definable in a polynomially bounded o-minimal structure) with circular link (homeomorphic to the circle $\mathbb{S}^...
arxiv.org/abs/2501.18030v1
Kohnert polynomials and their associated posets are combinatorial objects with deep geometric and representation theoretic connections, generalizing both Schubert polynomials and type A Demazure characters. In this paper, we explore the properties of...
arxiv.org/abs/1109.3286v1
We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes, invariant framewo...
www.bing.com/ck/a?!&&p=7fb8567e985d9bb9c27f2c6971a4b97309b56d518fba5637b12370822699a123JmltdHM9MTc3MjU4MjQwMA&ptn=3&ver=2&hsh=4&fclid=2eda175c-2a11-6541-2965-004e2b10640f&u=a1aHR0cHM6Ly93d3cud2Vmb3J1bS5vcmcvcHVibGljYXRpb25zL3RlY2hub2xvZ3ktY29udmVyZ2VuY2UtcmVwb3J0LTIwMjUv&ntb=1
Jun 3, 2025 · The Technology Convergence Report 2025 offers leaders a strategic lens – the 3C Framework – to help them navigate the combinatorial innovation era.
arxiv.org/abs/1508.05013v1
Graphical models use the intuitive and well-studied methods of graph theory to implicitly represent dependencies between variables in large systems. They can model the global behaviour of a complex system by specifying only local factors. This thesis...
arxiv.org/abs/2110.07945v1
We study ultrafilters on countable sets and reaping families which are indestructible by Sacks forcing. We deal with the combinatorial characterization of such families and we prove that every reaping family of size smaller than the continuum is Sack...
arxiv.org/abs/2502.16170v1
Recent advancements in Neural Combinatorial Optimization (NCO) have shown promise in solving routing problems like the Traveling Salesman Problem (TSP) and Capacitated Vehicle Routing Problem (CVRP) without handcrafted designs. Research in this domai...
en.wikipedia.org/wiki/Binomial_coefficient
natural number for any natural numbers n and k. There are many other combinatorial interpretations of binomial coefficients (counting problems for which
www.reddit.com/r/explainlikeimfive/comments/1qwe7mo/eli5_what_is_p_np/
Can someone please explain this ? I took a combinatorial optimisation during my masters, and for the life of me, I couldn’t quite wrap my head around this topic. Please don’t judge me ?...
www.reddit.com/r/CuratedTumblr/comments/1najlc7/the_haruhi_problem_aka_how_anime_being_aired_in/
...
arxiv.org/abs/2403.06280v3
This paper is part of a series of three articles with the objective of investigating a stratified version of the homotopy hypothesis in terms of semi-model structures that interact well with classical examples of stratified spaces, such as Whitney st...
arxiv.org/abs/2305.01774v2
Di Francesco introduced Aztec triangles as combinatorial objects for which their domino tilings are equinumerous with certain sets of configurations of the twenty-vertex model that are the main focus of his article. We generalize Di Francesco's const...
arxiv.org/abs/2303.04113v2
We give a combinatorial formula for the Ehrhart coefficients of a certain class of weighted multi-hypersimplices. In a special case, where these polytopes coincide with the base polytope of the panhandle matroid $\textrm{Pan}_{k,n-2,n}$, we show that...
arxiv.org/abs/math/0606479v2
In this note we give a combinatorial characterization of all the unmixed bipartite graphs....
arxiv.org/abs/2202.00473v1
This paper studies a single-suit version of the card game War on a finite deck of cards. There are varying methods of how players put the cards that they win back into their hands, but we primarily consider randomly putting the cards back and determi...
arxiv.org/abs/2108.09367v1
Generalized Geography is a combinatorial game played on a directed graph. Players take turns moving a token from vertex to vertex, deleting a vertex after moving the token away from it. A player unable to move loses. It is well known that the computa...
arxiv.org/abs/1805.00990v2
This is a short note on various results about the combinatorial properties of line arrangements in terms of the Chern numbers of the corresponding log surfaces. This resembles the study of the geography of surfaces of general type. We prove some new...
arxiv.org/abs/0707.1415v1
Every closed oriented PL 4-manifold is a branched cover of the 4-sphere branched over a PL-surface with finitely many singularities by Piergallini [Topology 34(3):497-508, 1995]. This generalizes a long standing result by Hilden and Montesinos to d...