Search results for "Mathematics - Combinatorics"
showing 10 items of 67 documents
Steiner configurations ideals: Containment and colouring
2021
Given a homogeneous ideal I&sube
Steiner systems and configurations of points
2020
AbstractThe aim of this paper is to make a connection between design theory and algebraic geometry/commutative algebra. In particular, given any Steiner SystemS(t, n, v) we associate two ideals, in a suitable polynomial ring, defining a Steiner configuration of points and its Complement. We focus on the latter, studying its homological invariants, such as Hilbert Function and Betti numbers. We also study symbolic and regular powers associated to the ideal defining a Complement of a Steiner configuration of points, finding its Waldschmidt constant, regularity, bounds on its resurgence and asymptotic resurgence. We also compute the parameters of linear codes associated to any Steiner configur…
Additive properties of fractal sets on the parabola
2023
Let $0 \leq s \leq 1$, and let $\mathbb{P} := \{(t,t^{2}) \in \mathbb{R}^{2} : t \in [-1,1]\}$. If $K \subset \mathbb{P}$ is a closed set with $\dim_{\mathrm{H}} K = s$, it is not hard to see that $\dim_{\mathrm{H}} (K + K) \geq 2s$. The main corollary of the paper states that if $0 0$. This information is deduced from an $L^{6}$ bound for the Fourier transforms of Frostman measures on $\mathbb{P}$. If $0 0$, then there exists $\epsilon = \epsilon(s) > 0$ such that $$ \|\hat{\mu}\|_{L^{6}(B(R))}^{6} \leq R^{2 - (2s + \epsilon)} $$ for all sufficiently large $R \geq 1$. The proof is based on a reduction to a $\delta$-discretised point-circle incidence problem, and eventually to the $(s,2s)$-…
A note on Kakeya sets of horizontal and SL(2) lines
2022
We consider unions of $SL(2)$ lines in $\mathbb{R}^{3}$. These are lines of the form $$L = (a,b,0) + \mathrm{span}(c,d,1),$$ where $ad - bc = 1$. We show that if $\mathcal{L}$ is a Kakeya set of $SL(2)$ lines, then the union $\cup \mathcal{L}$ has Hausdorff dimension $3$. This answers a question of Wang and Zahl. The $SL(2)$ lines can be identified with horizontal lines in the first Heisenberg group, and we obtain the main result as a corollary of a more general statement concerning unions of horizontal lines. This statement is established via a point-line duality principle between horizontal and conical lines in $\mathbb{R}^{3}$, combined with recent work on restricted families of projecti…
Le cône diamant symplectique
2009
Resume Si n + est le facteur nilpotent d'une algebre semi-simple g , le cone diamant de g est la description combinatoire d'une base d'un n + module indecomposable naturel. Cette notion a ete introduite par N.J. Wildberger pour sl ( 3 ) , le cone diamant de sl ( n ) est decrit dans Arnal (2006) [2] , celui des algebres semi-simples de rang 2 dans Agrebaoui (2008) [1] . Dans cet article, nous generalisons ces constructions au cas des algebres de Lie sp ( 2 n ) . Les tableaux de Young semi-standards symplectiques ont ete definis par C. De Concini (1979) [4] , ils forment une base de l'algebre de forme de sp ( 2 n ) . Nous introduisons ici la notion de tableaux de Young quasi standards symplec…
Combinatorial Gray codes for classes of pattern avoiding permutations
2007
The past decade has seen a flurry of research into pattern avoiding permutations but little of it is concerned with their exhaustive generation. Many applications call for exhaustive generation of permutations subject to various constraints or imposing a particular generating order. In this paper we present generating algorithms and combinatorial Gray codes for several families of pattern avoiding permutations. Among the families under consideration are those counted by Catalan, Schr\"oder, Pell, even index Fibonacci numbers and the central binomial coefficients. Consequently, this provides Gray codes for $\s_n(\tau)$ for all $\tau\in \s_3$ and the obtained Gray codes have distances 4 and 5.
Combinatorics of generalized Bethe equations
2012
A generalization of the Bethe ansatz equations is studied, where a scalar two-particle S-matrix has several zeroes and poles in the complex plane, as opposed to the ordinary single pole/zero case. For the repulsive case (no complex roots), the main result is the enumeration of all distinct solutions to the Bethe equations in terms of the Fuss-Catalan numbers. Two new combinatorial interpretations of the Fuss-Catalan and related numbers are obtained. On the one hand, they count regular orbits of the permutation group in certain factor modules over \({\mathbb{Z}^M}\), and on the other hand, they count integer points in certain M-dimensional polytopes.
Free Minor Closed Classes and the Kuratowski theorem
2009
Free-minor closed classes [2] and free-planar graphs [3] are considered. Versions of Kuratowski-like theorem for free-planar graphs and Kuratowski theorem for planar graphs are considered.
On shortening u-cycles and u-words for permutations
2017
Abstract This paper initiates the study of shortening universal cycles (u-cycles) and universal words (u-words) for permutations either by using incomparable elements, or by using non-deterministic symbols. The latter approach is similar in nature to the recent relevant studies for the de Bruijn sequences. A particular result we obtain in this paper is that u-words for n -permutations exist of lengths n ! + ( 1 − k ) ( n − 1 ) for k = 0 , 1 , … , ( n − 2 ) ! .
Random tensor theory: extending random matrix theory to random product states
2009
We consider a problem in random matrix theory that is inspired by quantum information theory: determining the largest eigenvalue of a sum of p random product states in (C^d)^{otimes k}, where k and p/d^k are fixed while d grows. When k=1, the Marcenko-Pastur law determines (up to small corrections) not only the largest eigenvalue ((1+sqrt{p/d^k})^2) but the smallest eigenvalue (min(0,1-sqrt{p/d^k})^2) and the spectral density in between. We use the method of moments to show that for k>1 the largest eigenvalue is still approximately (1+sqrt{p/d^k})^2 and the spectral density approaches that of the Marcenko-Pastur law, generalizing the random matrix theory result to the random tensor case.…