English
Related papers

Related papers: An integral weight realization theorem for subset …

200 papers

For each $N\geq 1$, let $G_N$ be a simple random graph on the set of vertices $[N]=\{1,2, ..., N\}$, which is invariant by relabeling of the vertices. The asymptotic behavior as $N$ goes to infinity of correlation functions: $$ \mathfrak…

Probability · Mathematics 2014-10-30 Camille Male , Sandrine Péché

We give a combinatorial polynomial-time algorithm to find a maximum weight independent set in perfect graphs of bounded degree that do not contain a prism or a hole of length four as an induced subgraph. An even pair in a graph is a pair of…

Combinatorics · Mathematics 2024-01-09 Tara Abrishami , Maria Chudnovsky , Cemil Dibek , Kristina Vušković

We study the intersection of finitely generated factor-free subgroups of free products of groups by utilizing the method of linear programming. For example, we prove that if $H_1$ is a finitely generated factor-free noncyclic subgroup of…

Group Theory · Mathematics 2018-01-03 Sergei V. Ivanov

Let G be any locally compact, unimodular, metrizable group. The main result of this paper, roughly stated, is that if F<G is any finitely generated free group and \Gamma < G any lattice, then up to a small perturbation and passing to a…

Group Theory · Mathematics 2014-11-11 Lewis Bowen

We prove that if $ T $ is a semi-special tree that is not special, then there exists a graph $ G $, formed as an inflation of a sparse $ T $-graph, such that for any special tree $ S $, $ G $ is not a subdivision of an inflation of an…

Logic · Mathematics 2024-11-11 Leandro Aurichi , Gabriel Fernandes , Paulo Magalhães Júnior

The main theorem in this paper is a far-reaching generalization of Gleason's theorem on the weight enumerators of codes which applies to arbitrary-genus weight enumerators of self-dual codes defined over a large class of finite rings and…

Number Theory · Mathematics 2007-07-16 Gabriele Nebe , E. M. Rains , N. J. A. Sloane

In this paper we present a combinatorial machinery, consisting of a graph tower $\overleftarrow \Gamma$ and vector towers $\overleftarrow v$ on $\overleftarrow \Gamma$, which allows us to efficiently describe all invariant measures $\mu =…

Dynamical Systems · Mathematics 2020-03-12 Nicolas Bédaride , Arnaud Hilion , Martin Lustig

Let $\Gamma$ be a countable group and $\mathrm{Sub}(\Gamma)$ its Chabauty space, namely the compact $\Gamma$-space consisting of all subgroups of $\Gamma$. We call a subgroup $\Delta \in \mathrm{Sub}(\Gamma)$ a boomerang subgroup if for…

Group Theory · Mathematics 2024-09-24 Yair Glasner , Waltraud Lederle

Let $\mathcal{F}$ be an antichain of finite subsets of $\mathbb{N}$. How quickly can the quantities $|\mathcal{F}\cap 2^{[n]}|$ grow as $n\to\infty$? We show that for any sequence $(f_n)_{n\ge n_0}$ of positive integers satisfying…

Combinatorics · Mathematics 2022-06-14 Paul Balister , Emil Powierski , Alex Scott , Jane Tan

We give another proof that for every lambda >= beth_omega for every large enough regular kappa < beth_omega we have lambda^{[kappa]}= lambda, dealing with sufficient conditions for replacing beth_omega by aleph_omega. In section 2 we show…

Logic · Mathematics 2009-09-25 Saharon Shelah

In the setting of Carnot groups, we are concerned with the rectifiability problem for subsets that have finite sub-Riemannian perimeter. We introduce a new notion of rectifiability that is, possibly, weaker than the one introduced by…

Analysis of PDEs · Mathematics 2023-10-05 Sebastiano Don , Enrico Le Donne , Terhi Moisala , Davide Vittone

In \cite{BAMU}, an ergodic theorem \`a la Birkhoff-von Neumann for the action of the fundamental group of a compact negatively curved manifold on the boundary of its universal cover is proved. A quick corollary is the irreducibility of the…

Group Theory · Mathematics 2016-01-06 Adrien Boyer , Antoine Pinochet Lobos

We study the $\Gamma$-convergence of the functionals $F_n(u):= || f(\cdot,u(\cdot),Du(\cdot))||_{p_n(\cdot)}$ and $\mathcal{F}_n(u):= \int_{\Omega} \frac{1}{p_n(x)} f^{p_n(x)}(x,u(x),Du(x))dx$ defined on $X\in \{L^1(\Omega,\mathbb{R}^d),…

Optimization and Control · Mathematics 2020-05-19 Francesca Prinari , Michela Eleuteri

Let $P_k$ be the subgroup generated by $k$th powers of primitive elements in $F_r$, the free group of rank $r$. We show that $F_2/P_k$ is finite if and only if $k$ is $1$, $2$, or $3$. We also fully characterize $F_2/P_k$ for $k = 2,3,4$.…

Group Theory · Mathematics 2021-01-06 Khalid Bou-Rabee , W. Patrick Hooper

We define gauge theories whose gauge group includes charge conjugation as well as standard $\mathrm{SU}(N)$ transformations. When combined, these transformations form a novel type of group with a semidirect product structure. For $N$ even,…

High Energy Physics - Theory · Physics 2020-02-24 Guillermo Arias-Tamargo , Antoine Bourget , Alessandro Pini , Diego Rodriguez-Gomez

A theorem of A.A. Brudno says that the Kolmogorov-Sinai entropy of a subshift X over $\mathbb{N}$ with respect to an ergodic measure $\mu$ equals the asymptotic Kolmogorov complexity of almost every word $\omega$ in X. The purpose of this…

Dynamical Systems · Mathematics 2015-12-15 Nikita Moriakov

Given a connected semisimple Lie group $G$ and an arithmetic subgroup $\Gamma$, it is well-known that each irreducible representation $\pi$ of $G$ occurs in the discrete spectrum $L^2_{\text{disc}}(\Gamma\backslash G)$ of…

Representation Theory · Mathematics 2023-06-06 Jun Yang

Let $R$ be a standard graded Noetherian algebra over an infinite field $K$ and $M$ a finitely generated $\mathbb{Z}$-graded $R$-module. Then for any graded ideal $I\subseteq R_+$ of $R$, we show that there exist integers $e_1\geq e_2$ such…

Commutative Algebra · Mathematics 2017-09-15 Dancheng Lu

In the Independent set problem, the input is a graph $G$, every vertex has a non-negative integer weight, and the task is to find a set $S$ of pairwise non-adjacent vertices, maximizing the total weight of the vertices in $S$. We give an…

Data Structures and Algorithms · Computer Science 2015-09-02 Daniel Lokshtanov , Marcin Pilipczuk , Erik Jan van Leeuwen

Given a family $\mathcal{H}$ of graphs, we say that a graph $G$ is $\mathcal{H}$-free if no induced subgraph of $G$ is isomorphic to a member of $\mathcal{H}$. Let $S_{t,t,t}$ be the graph obtained from $K_{1,3}$ by subdividing each edge…

Combinatorics · Mathematics 2025-02-10 Maria Chudnovsky , Julien Codsi , Daniel Lokshtanov , Martin Milanič , Varun Sivashankar