Zobrazeno 1 - 10
of 126
pro vyhledávání: '"O'Neill, Jason"'
Autor:
Johnston, Griffin, O'Neill, Jason
Given a vector $\alpha = (\alpha_1, \ldots, \alpha_k) \in \mathbb{F}_2^k$, we say a collection of subsets $\mathcal{F}$ satisfies $\alpha$-intersection pattern modulo $2$ if all $i$-wise intersections consisting of $i$ distinct sets from $\mathcal{F}
Externí odkaz:
http://arxiv.org/abs/2312.13588
Autor:
O'Neill, Jason Michael
This dissertation will focus on the use of multidimensional mass spectrometry (MS) techniques for the characterization of complex polymeric materials and mixtures, especially of samples that are impossible or difficult to characterize by other analyt
Publikováno v:
In International Journal of Mass Spectrometry October 2024 504
Autor:
Buchanan, Calum, Clifton, Alexander, Culver, Eric, Nie, Jiaxi, O'Neill, Jason, Rombach, Puck, Yin, Mei
Given a finite simple graph $G$, an odd cover of $G$ is a collection of complete bipartite graphs, or bicliques, in which each edge of $G$ appears in an odd number of bicliques and each non-edge of $G$ appears in an even number of bicliques. We denot
Externí odkaz:
http://arxiv.org/abs/2202.09822
Autor:
O'Neill, Jason, Spiro, Sam
A convex geometric hypergraph (abbreviated cgh) consists of a collection of subsets of a strictly convex set of points in the plane. Extremal problems for cgh's have been extensively studied in the literature, and in this paper we consider their corr
Externí odkaz:
http://arxiv.org/abs/2109.09931
Autor:
O'Neill, Jason
Given a collection $\mathcal{A}$ of subsets of an $n$ element set, let $\text{op}(\mathcal{A})$ denote the number of distinct pairs $A,B \in \mathcal{A}$ for which $|A \cap B|$ is odd. For $s \in \{1,2\}$, we prove $\text{op}(\mathcal{A}) \geq s \cdo
Externí odkaz:
http://arxiv.org/abs/2109.09925
Autor:
O'Neill, Jason, Verstraëte, Jacques
For integers $2 \leq t \leq k$, we consider a collection of $k$ set families $\mathcal{A}_j: 1 \leq j \leq k$ where $\mathcal{A}_j = \{ A_{j,i} \subseteq [n] : 1 \leq i \leq m \}$ and $|A_{1, i_1} \cap \cdots \cap A_{k,i_k}|$ is even if and only if a
Externí odkaz:
http://arxiv.org/abs/2011.09402
A convex geometric hypergraph or cgh consists of a family of subsets of a strictly convex set of points in the plane. There are eight pairwise nonisomorphic cgh's consisting of two disjoint triples. These were studied at length by Bra{\ss} (2004) and
Externí odkaz:
http://arxiv.org/abs/2010.11100
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
O'Neill, Jason, Verstraete, Jacques
For an integer $d \geq 2$, a family $\mathcal{F}$ of sets is $\textit{$d$-wise intersecting}$ if for any distinct sets $A_1,A_2,\dots,A_d \in \mathcal{F}$, $A_1 \cap A_2 \cap \dots \cap A_d \neq \emptyset$, and $\textit{non-trivial}$ if $\bigcap \mat
Externí odkaz:
http://arxiv.org/abs/1911.01031