Results 51 to 60 of about 2,700,684 (210)
Abundant Neighborhoods, Two‐Sided Markets, and Maximal Matchings
Naval Research Logistics (NRL), EarlyView.ABSTRACT I introduce a new graph‐theoretic property called abundant neighborhoods. This property is motivated by studying the thickness of economic markets. A vertex is, roughly, guaranteed to match if and only if it has an abundant neighborhood.
Muhammad Maaz
wiley +1 more source
Extended Rate, more GFUN [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We present a software package that guesses formulas for sequences of, for example, rational numbers or rational functions, given the first few terms.
Martin Rubey
doaj +1 more source
Combinatorial optimization approach for the efficient reuse of RC components
Structural Concrete, EarlyView.Abstract The reuse of reinforced concrete (RC) components from deconstructed buildings offers a promising approach to reduce the environmental impact of new constructions. However, it represents a complex combinatorial optimization problem to efficiently place the available modules, which vary in geometry and load‐bearing capacity, into new structures ...
Jannis Rose +4 more
wiley +1 more source
Mixed Powers of Generating Functions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 Given an integer $m \geq 1$, let $\| \cdot \|$ be a norm in $\mathbb{R}^{m+1}$ and let $\mathbb{S}_+^m$ denote the set of points $\mathbf{d}=(d_0,\ldots,d_m)$ in $\mathbb{R}^{m+1}$ with nonnegative coordinates and such that $\| \mathbf{d} \|=1$. Consider
Manuel Lladser
doaj +1 more source
Isosurface Extraction for Signed Distance Functions using Power Diagrams
Computer Graphics Forum, EarlyView.Abstract Contouring an implicit function typically considers function values in the vicinity of the desired level set, only. In a recent string of works, Sellán at al. have demonstrated that signed distance values contain useful information also if they are further away from the surface.
M. Kohlbrenner, M. Alexa
wiley +1 more source
On the set of Fixed Points of the Parallel Symmetric Sand Pile Model [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 Sand Pile Models are discrete dynamical systems emphasizing the phenomenon of $\textit{Self-Organized Criticality}$. From a configuration composed of a finite number of stacked grains, we apply on every possible positions (in parallel) two grain moving ...
Kévin Perrot +2 more
doaj +1 more source
On the isomorphism problem for monoids of product‐one sequences
Bulletin of the London Mathematical Society, Volume 57, Issue 5, Page 1482-1495, May 2025.Abstract Let G1$G_1$ and G2$G_2$ be torsion groups. We prove that the monoids of product‐one sequences over G1$G_1$ and over G2$G_2$ are isomorphic if and only if the groups G1$G_1$ and G2$G_2$ are isomorphic. This was known before for abelian groups.
Alfred Geroldinger, Jun Seok Oh
wiley +1 more source
Around the root of random multidimensional quadtrees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We analyse the distribution of the root pattern of randomly grown multidimensional point quadtrees. In particular, exact, recursive and asymptotic formulas are given for the expected arity of the root.
Gilbert Labelle +2 more
doaj +1 more source
Coloured shuffle compatibility, Hadamard products, and ask zeta functions
Bulletin of the London Mathematical Society, EarlyView.Abstract We devise an explicit method for computing combinatorial formulae for Hadamard products of certain rational generating functions. The latter arise naturally when studying so‐called ask zeta functions of direct sums of modules of matrices or class‐ and orbit‐counting zeta functions of direct products of nilpotent groups.
Angela Carnevale +2 more
wiley +1 more source
Efficient estimation of the cardinality of large data sets [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 Giroire has recently proposed an algorithm which returns the $\textit{approximate}$ number of distinct elements in a large sequence of words, under strong constraints coming from the analysis of large data bases.
Philippe Chassaing, Lucas Gerin
doaj +1 more source