Results 51 to 60 of about 69,062 (214)
Generalisation : graphs and colourings [PDF]
, 2020 The interaction between practice and theory in mathematics is a central theme. Many mathematical structures and theories result from the formalisation of a real problem. Graph Theory is rich with such examples.
Zarb, Christina
core
Symplectic rigidity and quantum mechanics [PDF]
, 2018 Ideas from Hodge theory have found important applications in representation theory. We give a survey of joint work with Ben Elias which uncovers Hodge theoretic structure in the Hecke category ("Soergel bimodules"). We also outline similarities and differences to other combinatorial Hodge theories.
Guichard, Olivier, Wienhard, Anna
openaire +19 more sources
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
New bounds for equiangular lines
, 2014 A set of lines in $\mathbb{R}^n$ is called equiangular if the angle between each pair of lines is the same. We address the question of determining the maximum size of equiangular line sets in $\mathbb{R}^n$, using semidefinite programming to improve the ...
Barg, Alexander, Yu, Wei-Hsuan
core +1 more source
, 2006 This is the report on the Oberwolfach workshop on Combinatorics, held 1–7 January 2006. Combinatorics is a branch of mathematics studying families of mainly, but not exclusively, finite or countable structures – discrete objects.
core +2 more sources
On 3‐Designs From P G L ( 2 , q ) $PGL(2,q)$
Journal of Combinatorial Designs, EarlyView.ABSTRACT The group P G L ( 2 , q ) $PGL(2,q)$ acts 3‐transitively on the projective line G F ( q ) ∪ { ∞ } $GF(q)\cup \{\infty \}$. Thus, an orbit of its action on the k $k$‐subsets of the projective line is the block set of a 3‐ ( q + 1 , k , λ ) $(q+1,k,\lambda )$ design.
Paul Tricot
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
Beck's Conjecture for Power Graphs [PDF]
, 2014 Beck's conjecture on coloring of graphs associated to various algebraic objects has generated considerable interest in the community of discrete mathematics and combinatorics since its inception in the year 1988.
Das, Priya, Mukherjee, Himadri
core
Some local--global phenomena in locally finite graphs
, 2020 In this paper we present some results for a connected infinite graph $G$ with finite degrees where the properties of balls of small radii guarantee the existence of some Hamiltonian and connectivity properties of $G$. (For a vertex $w$ of a graph $G$ the
Asratian, Armen S. +2 more
core +1 more source
Completing Partial k $k$ ‐Star Designs
Journal of Combinatorial Designs, EarlyView.ABSTRACT A k $k$ ‐star is a complete bipartite graph K 1 , k ${K}_{1,k}$ . A partial k $k$ ‐star design of order n $n$ is a pair ( V , A ) $(V,{\mathscr{A}})$ where V $V$ is a set of n $n$ vertices and A ${\mathscr{A}}$ is a set of edge‐disjoint k $k$ ‐stars whose vertex sets are subsets of V $V$ .
Ajani De Vas Gunasekara, Daniel Horsley
wiley +1 more source