A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems

1991
*
Journal of combinatorial theory. Series A
*

Let us arrange all subsets of [n] in a

doi:10.1016/0097-3165(91)90058-o
fatcat:wbk63rm3cjefrco5obpdj63nqy
*linear**order*, denoted -c, such that J< I implies (JI < 111. ... The q-analogue of this example is the set of partial*linear*functions mapping a subspace of a*linear*space A over F, into a*linear*space B over F,, again*ordered*by restriction. ...##
###
On a conjecture of Marcus and de Oliveira

1994
*
Linear Algebra and its Applications
*

First the problem is reduced to the question of nonnegative solvability of a certain system of

doi:10.1016/0024-3795(94)90107-4
fatcat:d4q7fevparfdvjhiais6y4ozwy
*linear*equations. ... In other words, we shall show the solvability of the following system (I) of 2n + n2*linear*equations in reals Sij > 0: In*order*to state our second lemma we introduce for i, j E [n] the quantities wl( ... there t,, CT E S,, such that for all*equicardinal*pairs ( I, K) for Clearly, instead of (1,2)*one*can choose any fried two-element su[n]. ...##
###
Splitting necklaces, with constraints
[article]

2020
*
arXiv
*
pre-print

the number of cuts,

arXiv:1907.09740v4
fatcat:5jeoa4g5nrfk5hjzilje7twrqu
*one*guarantees the existence of a fair splitting such that each thief is allocated (approximately)*one*and the same number of pieces of the necklace (including "degenerate pieces" ... Alon's "necklace-splitting theorem", subject to additional constraints, as illustrated by the following results. (1) The "almost*equicardinal*necklace-splitting theorem" claims that, without increasing ... Note that the cut points (all N = (r − 1)n of them) are linearly*ordered*, which induces a*linear**ordering**on*all N + 1 intervals (including degenerate). ...##
###
On Ascertaining Inductively the Dimension of the Joint Kernel of Certain Commuting Linear Operators, II

1996
*
Advances in Mathematics
*

Given an index set X, a collection IB of subsets of X, and a collection ('x : x 2 X) of commuting

doi:10.1006/aima.1996.0072
fatcat:2t2cbmgyubey3kpnj4w4gjx3ru
*linear*maps*on*some*linear*space, the family of*linear*operators whose joint kernel K = K(IB) is sought ... It is shown that certain conditions*on*IB and', used in BRS] to obtain the inequality or the corresponding equality, can be weakened. ... Let S be a real*linear*space, let`: X ! L(S) : x 7 !`x be some map into the space of*linear*maps*on*S, and assume that its images commute. Then, the association X 7 ! ...##
###
Non-Count Symmetries in Boolean & Multi-Valued Prob. Graphical Models
[article]

2017
*
arXiv
*
pre-print

However, existing algorithms for Boolean-valued domains can identify only those pairs of states as symmetric, in which the number of

arXiv:1707.08879v1
fatcat:6xbv5vdjbbdv3mwit4hy27su5m
*ones*and zeros match exactly (count symmetries). ... Given a value v ∈ D i , we choose a representative value from its equivalence class based*on*some canonical*ordering*. We denote this value by rep i (v). ... Orbital MCMC suffices for downstream inference over most kinds of symmetries except non-*equicardinal**ones*, for which a Metropolis Hastings extension is needed. ...##
###
Nullity and Loop Complementation for Delta-Matroids

2013
*
SIAM Journal on Discrete Mathematics
*

We characterize delta-matroids in terms of

doi:10.1137/110854692
fatcat:aoyrayvicbc7pbzl3grtuwocey
*equicardinality*of minimal sets with respect to inclusion (in addition we obtain similar characterizations for matroids). ... ., the delta-matroids obtained after loop complementation and after pivot*on*a single element together with the original delta-matroid fulfill the property that two of them have equal "null space" while ... We are much indebted to the anonymous reviewers for valuable comments*on*earlier versions of this paper. ...##
###
Dominating cliques in chordal graphs

1994
*
Discrete Mathematics
*

A strongly chordal graph which has a dominating clique has

doi:10.1016/0012-365x(94)90118-x
fatcat:nxrasbv26jgpbofde6aebvac24
*one*as small as the smallest dominating set-and, furthermore, there is a*linear*-time algorithm to find such a small dominating clique. ... Farber's algorithm, given a strongly chordal graph G with a strong elimination*ordering*of the vertices, finds in*linear*time a dominating set D and an*equicardinal*set A of vertices whose neighbourhoods ... C and an*equicardinal*set A of vertices whose neighbourhoods are disjoint. ...##
###
Latroids and their representation by codes over modules

2003
*
Transactions of the American Mathematical Society
*

In fact a generator matrix for a

doi:10.1090/s0002-9947-03-03367-1
fatcat:cfbbo7757fbrtjoqv2qs65ujj4
*linear*code over a field is also a representation of a matroid over that field. ... It has been known for some time that there is a connection between*linear*codes over fields and matroids represented over fields. ... We arbitrarily*order*these k simple modules as S 1 , S 2 , . . . , S k , and then fix this*ordering*. ...##
###
Page 4332 of Mathematical Reviews Vol. , Issue 98G
[page]

1998
*
Mathematical Reviews
*

Summary: “Given an index set X, a collection B of subsets of X, and a collection (/,: x € X) of commuting

*linear*maps*on*some*linear*space, the family of*linear*operators whose joint kernel K = K(B) is ... He gives a characterization of the approximation*order*provided by a refinable function in terms of the*order*of the sum rules satisfied by the refinable mask. ...##
###
A general model for matroids and the greedy algorithm

2008
*
Mathematical programming
*

Whether a similar representation is possible for matroids

doi:10.1007/s10107-008-0213-1
fatcat:pquzmtgrnrfx5onczlrtmw5n24
*on*convex geometries is an open question. * ... We discuss the relationship between these general matroids and classical matroids and provide a Dilworth embedding that allows us to represent matroids with underlying partial*order*structures within classical ... In*order*to establish (E, M) as an H * -matroid, we need an additional assumption*on*H * . ...##
###
Pure pairs. I. Trees and linear anticomplete pairs
[article]

2020
*
arXiv
*
pre-print

Using concavity An

arXiv:1809.00919v3
fatcat:l3o5enqchndd5fiy27qhvlyvia
*ordered*graph is a graph J together with a*linear**order*of its vertex set. Isomorphism of*ordered*graphs is defined in the natural way. Let B = (B i : i ∈ I) be a blockade in G. ... Let v ∈ Z, and take a*linear**order*of C; and let i ∈ C be the first member of C (under this*order*) such that v meets E i ∪ F i (there is such a member i from the definition of Z). ...##
###
Page 1789 of Mathematical Reviews Vol. , Issue 92c
[page]

1992
*
Mathematical Reviews
*

L. (1-SIL); Jackson, Bill (4-LNDG);
Lou, Ding Jun (PRC-ZHO-C); Saito, Akira (J-NIHO)
Partitioning regular graphs into

*equicardinal**linear*forests. Discrete Math. 88 (1991), no. 1, 1-9. ... The authors have previously introduced a partial*ordering*of finite graphs in*order*to study embeddings*on*surfaces. ...##
###
Page 1789 of Mathematical Reviews Vol. , Issue 92d
[page]

1992
*
Mathematical Reviews
*

L. (1-SIL); Jackson, Bill (4-LNDG);
Lou, Ding Jun (PRC-ZHO-C); Saito, Akira (J-NIHO)
Partitioning regular graphs into

*equicardinal**linear*forests. Discrete Math. 88 (1991), no. 1, 1-9. ... The authors have previously introduced a partial*ordering*of finite graphs in*order*to study embeddings*on*surfaces. ...##
###
Dependence systems with the operator–image exchange property

1994
*
Discrete Mathematics
*

This is

doi:10.1016/0012-365x(94)90030-2
fatcat:7jtwlwcbbzcrljc3iudcnpeyt4
*one*of several equivalent ways to define a dependence system. ... An operator*on*a set S, i.e. an extensive and monotone (but not necessarily idempotent) function*on*the power set of S, generalizes the familiar notion of closure operator (transitive operator). ... A different kind of exchange property, well known from the early works*on**linear*dependence and matroids, which played an essential role in the development of the theory, is exchange property for finite ...##
###
Partitioning regular graphs into equicardinal linear forests

1991
*
Discrete Mathematics
*

*On*the other hand, in [4] there is a conjecture that if the number of edges of a 3-regular graph is even (i.e. its

*order*is divisible by 4), then E(G) can be partitioned into two isomorphic

*linear*forests ... In

*order*to prove Theorem 1 and Theorem 2, we first consider connected graphs G with A(G) s 3 and 6(G) = 2. Definition. ...

« Previous

*Showing results 1 — 15 out of 196 results*